scientific article; zbMATH DE number 3874956
From MaRDI portal
Publication:3340498
Recommendations
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- scientific article; zbMATH DE number 3990246
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On lifted cover inequalities: a new lifting procedure with unusual properties
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
Cited in
(16)- The submodular knapsack polytope
- The complexity of lifted inequalities for the knapsack problem
- Polyhedral results for the precedence-constrained knapsack problem
- Zero-lifting for integer block structured problems
- Supermodular covering knapsack polytope
- On the mixed set covering, packing and partitioning polytope
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3}
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Cutting planes in integer and mixed integer programming
- Cover and pack inequalities for (mixed) integer programming
- Knapsack polytopes: a survey
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340498)
