13 search results - page 2 / 3 » On separating cover inequalities for the multidimensional kn... |
ANOR
2002
13 years 5 months ago
2002
We use surrogate analysis and constraint pairing in multidimensional knapsack problems to fix some variables to zero and to separate the rest into two groups
IPCO
2007
13 years 7 months ago
2007
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...
ORL
1998
13 years 5 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...
STOC
1993
ACM
13 years 9 months 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...
IPCO
2007
13 years 7 months ago
2007
We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of t...