205 search results - page 9 / 41 » Valid inequalities for mixed integer linear programs |
ENDM
2010
13 years 8 months ago
2010
We call "on/off" constraint an algebraic constraint that is activated if and only if
IOR
2002
13 years 8 months ago
2002
EOR
2010
13 years 6 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
STOC
1993
ACM
14 years 19 days ago
1993
ACM
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
ORL
1998
13 years 8 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...