Knapsack polytopes: a survey
- 19 September 2019
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 292 (1) , 469-517
Abstract
No abstract availableKeywords
Funding Information
- DFG (SFB 805, TRR 154)
- DFG (SPP 1798, EXPRESS)
- DFG (SFB 805)
This publication has 109 references indexed in Scilit:
- A cutting plane method for knapsack polytopeJournal of Computer and Systems Sciences International, 2009
- A computational study of exact knapsack separation for the generalized assignment problemComputational Optimization and Applications, 2008
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopesDiscrete Optimization, 2008
- The complexity of cover inequality separationOperations Research Letters, 1998
- The complementary class of generalized flow cover inequalitiesDiscrete Applied Mathematics, 1997
- Lifting cover inequalities for the precedence-constrained knapsack problemDiscrete Applied Mathematics, 1997
- Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separationDiscrete Applied Mathematics, 1995
- Polyhedral results for the precedence-constrained knapsack problemDiscrete Applied Mathematics, 1993
- A characterization of knapsacks with the max-flow-—min-cut propertyOperations Research Letters, 1992
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984