Sciweavers

129 search results - page 1 / 26
» Valid Inequalities Based on Simple Mixed-Integer Sets
Sort
View
IPCO
2004
100views Optimization» more  IPCO 2004»
13 years 6 months 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
INFORMS
2010
100views more  INFORMS 2010»
13 years 2 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...
MOR
2010
113views more  MOR 2010»
13 years 3 months ago
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs
We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several m...
Michele Conforti, Laurence A. Wolsey, Giacomo Zamb...
ANOR
2007
126views more  ANOR 2007»
13 years 5 months ago
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...
Quentin Louveaux, Laurence A. Wolsey
DISOPT
2007
109views more  DISOPT 2007»
13 years 4 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