scientific article

zbMath0548.90048MaRDI QIDQ3340498

Egon Balas, Eitan Zemel

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polytopeminimal coverpositive coefficientsgeneralized facet lifting procedurenontrivial facet

Mathematics Subject Classification ID

Boolean programming (90C09) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Polytopes and polyhedra (52Bxx)

Related Items (14)

Knapsack polytopes: a survey ⋮ Lifting inequalities: a framework for generating strong cuts for nonlinear programs ⋮ A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting ⋮ Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions ⋮ Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes ⋮ Supermodular covering knapsack polytope ⋮ On the mixed set covering, packing and partitioning polytope ⋮ The complexity of lifted inequalities for the knapsack problem ⋮ Polyhedral results for the precedence-constrained knapsack problem ⋮ Cutting planes in integer and mixed integer programming ⋮ On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) ⋮ The submodular knapsack polytope ⋮ A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems ⋮ Cover and pack inequalities for (mixed) integer programming

This page was built for publication: