For a class of variational inequalities on a Hubert space H bifurcating solutions exist and may be characterized as critical points of a functional with respect to the intersection of the level surfaces of another functional and a closed convex subset K of H. In a recent paper [13] we have used a gradient-projection type algorithm to obtain the solutions for discretizations of the variational i...

In this paper we consider the problem of k-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the objective of minimizing the sum of the costs of the edges between the subsets of the partition. Based on a study of valid inequalities, we present a variety of separation heuristics for cycle, cycle with ears, knapsack tr...

In this paper, we establish some Bernstein type inequalities for the complex polynomial. Our results constitute generalizations and refinements of some well-known polynomial inequalities.

The signal segmentation approach described herein assumes that the signal can be accurately modelled by a linear regression with piece-wise constant parameters. A simultaneous estimate of the change times is considered. The maximum likelihood and maximum a posteriori probability estimates are derived after marginalization of the linear regression parameters and the measurement noise variance, w...

In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear progra...

Under the Open Shortest Path First (OSPF) protocol, traffic flow in an Internet Protocol (IP) network is routed on the shortest paths between each source and destination. The shortest path is calculated based on pre-assigned weights on the network links. The OSPF weight setting problem is to determine a set of weights such that, if the flow is routed based on the OSPF protocol, some measure of ...

We prove that in the context of general Markov semigroups Beckner inequalities with constants separated from zero as $p\to 1^+$ are equivalent to modified log Sobolev inequality (previously only one implication was known hold this generality). Further, by adapting an argument Boucheron et al. we derive type moment estimates which under these functional inequalities. illustrate our results appli...

The first experimental SAM for Iran was constructed more than three decades ago under the supervision of Prof. Pyatt. Based on this work Prof Pyatt had observed that the way in which Iran was spending oil revenues was likely to exacerbate urban—rural income differentials in Iran. In his approach to SAM he did not distinguish between factorial and institutional income distributions preferring to...

BACKGROUND Although there is convincing evidence for the association between small for gestational age (SGA) and socioeconomic status (SES), it is not known to what extent explanatory factors contribute to this association. AIM To examine to what extent risk factors could explain educational inequalities in SGA. STUDY DESIGN In this study fully completed data were available for 3793 pregnan...

We consider a stochastic network interdiction problem in which the goal is to detect an evader, who selects a maximum-reliability path. Subject to a resource constraint, the interdictor installs sensors on a subset of the network’s arcs to minimize the value of the evader’s maximum-reliability path, i.e., to maximize the detection probability. When this decision is made, the evader’s origin–des...