Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes

DOI10.1137/S0895480192230607zbMath0832.90081MaRDI QIDQ4764349

Youngho Lee, Hanif D. Sherali

Publication date: 4 May 1995

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

liftingfacetsreformulation-linearization techniquegeneralized upper boundconstrained knapsack polytopepolynomial time of complexity

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Knapsack polytopes: a survey ⋮ Optimal multicast route packing ⋮ Surrogate-RLT cuts for zero-one integer programs ⋮ Sequence independent lifting for mixed knapsack problems with GUB constraints ⋮ A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting ⋮ Foundation-penalty cuts for mixed-integer programs. ⋮ Second-order cover inequalities ⋮ Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities ⋮ Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem ⋮ Cover and pack inequalities for (mixed) integer programming

This page was built for publication: Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes