Abstract
We give new facets and valid inequalities for the separable piecewise linear optimization (SPLO) knapsack polytope. We also extend the inequalities to the case in which some of the variables are semi-continuous. Finally, we give computational results that demonstrate their efficiency in solving difficult instances of SPLO and SPLO with semi-continuous constraints.
Original language | English |
---|---|
Pages (from-to) | 217-255 |
Number of pages | 39 |
Journal | Mathematical Programming |
Volume | 141 |
Issue number | 1-2 |
DOIs | |
State | Published - Oct 2013 |
Keywords
- Branch-and-cut
- Knapsack problem
- Mixed-integer programming
- Piecewise linear optimization
- Polyhedral method
- Semi-continuous variables
- Special ordered set