Sciweavers

26 search results - page 1 / 6
» Two-Step MIR Inequalities for Mixed Integer Programs
Sort
View
INFORMS
2010
100views more  INFORMS 2010»
13 years 8 months ago
Two-Step MIR Inequalities for Mixed Integer Programs
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
Sanjeeb Dash, Marcos Goycoolea, Oktay Günl&uu...
IPCO
2004
100views Optimization» more  IPCO 2004»
14 years 10 days ago
Valid Inequalities Based on Simple Mixed-Integer Sets
In this paper we use facets of simple mixed-integer sets with three variables to derive a parametric family of valid inequalities for general mixed-integer sets. We call these ine...
Sanjeeb Dash, Oktay Günlük
IPCO
2007
143views Optimization» more  IPCO 2007»
14 years 12 days ago
On the Exact Separation of Mixed Integer Knapsack Cuts
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
Ricardo Fukasawa, Marcos Goycoolea
DISOPT
2007
109views more  DISOPT 2007»
13 years 11 months ago
Sequential pairing of mixed integer inequalities
We present a scheme for generating new valid inequalities for mixed integer programs by taking pairwise combinations of existing valid inequalities. Our scheme is related to mixed...
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
ANOR
2005
94views more  ANOR 2005»
13 years 11 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