Abstract
We study the mixed 0-1 knapsack polytope, which is defined by a single knapsack constraint that contains 0-1 and bounded continuous variables. We develop a lifting theory for the continuous variables. In particular, we present a pseudo-polynomial algorithm for the sequential lifting of the continuous variables and we discuss its practical use.
Original language | English (US) |
---|---|
Pages (from-to) | 89-113 |
Number of pages | 25 |
Journal | Mathematical Programming |
Volume | 98 |
Issue number | 1-3 |
DOIs | |
State | Published - 2003 |
Externally published | Yes |
Keywords
- 0-1 mixed integer programming
- Lifting
- Polyhedral theory