Polyhedral properties for the intersection of two knapsacks
- 21 October 2006
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 113 (1) , 15-37
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Mixing mixed-integer inequalitiesMathematical Programming, 2001
- The 0-1 Knapsack problem with a single continuous variableMathematical Programming, 1999
- Partial cover and complete cover inequalitiesOperations Research Letters, 1994
- Facet of regular 0–1 polytopesMathematical Programming, 1975
- Faces for a linear inequality in 0–1 variablesMathematical Programming, 1975
- Facets of the knapsack polytopeMathematical Programming, 1975