Sciweavers

129 search results - page 2 / 26
» Valid Inequalities Based on Simple Mixed-Integer Sets
Sort
View
ANOR
2005
94views more  ANOR 2005»
13 years 5 months ago
Cover and Pack Inequalities for (Mixed) Integer Programming
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
Alper Atamtürk
IPCO
2004
93views Optimization» more  IPCO 2004»
13 years 7 months ago
Semi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
I. R. de Farias
IPCO
2008
136views Optimization» more  IPCO 2008»
13 years 7 months ago
Computing with Multi-row Gomory Cuts
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
Daniel G. Espinoza
MP
2010
126views more  MP 2010»
13 years 4 months ago
Two row mixed-integer cuts via lifting
Recently, Andersen et al. [1], Borozan and Cornu´ejols [7] and Cornu´ejols and Margot [10] characterized extreme inequalities of a system of two rows with two free integer varia...
Santanu S. Dey, Laurence A. Wolsey
EOR
2008
105views more  EOR 2008»
13 years 5 months ago
The multi-item capacitated lot-sizing problem with setup times and shortage costs
We address a multi-item capacitated lot-sizing problem with setup times and shortage costs that arises in real-world production planning problems. Demand cannot be backlogged, but...
Nabil Absi, Safia Kedad-Sidhoum