Sciweavers

MP
2006
66views more  MP 2006»
13 years 9 months ago
A convex-analysis perspective on disjunctive cuts
Gérard Cornuéjols, Claude Lemar&eacu...
MP
2006
77views more  MP 2006»
13 years 9 months ago
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems
In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigz...
Angel Corberán, Isaac Plana, José M....
MP
2006
101views more  MP 2006»
13 years 9 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie
MP
2006
72views more  MP 2006»
13 years 9 months ago
Recognizing Balanceable Matrices
A 0/
Michele Conforti, Giacomo Zambelli
MP
2006
78views more  MP 2006»
13 years 9 months ago
Valid inequalities based on the interpolation procedure
We study the interpolation procedure of Gomory and Johnson (1972), which generates cutting planes for general integer programs from facets of cyclic group polyhedra. This idea has...
Sanjeeb Dash, Oktay Günlük
MP
2006
137views more  MP 2006»
13 years 9 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
MP
2006
84views more  MP 2006»
13 years 9 months ago
Optimal 3-terminal cuts and linear programming
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...
MP
2006
93views more  MP 2006»
13 years 9 months ago
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
Xiaojun Chen, Shuhuang Xiang
MP
2006
101views more  MP 2006»
13 years 9 months ago
Robust optimization of contaminant sensor placement for community water systems
We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We f...
Robert D. Carr, Harvey J. Greenberg, William E. Ha...
MP
2006
74views more  MP 2006»
13 years 9 months ago
Network reinforcement
Francisco Barahona