Abstract
We report and analyze the results of our computational testing of branch-and-cut for piecewise linear optimization using the cutting planes given recently by Zhao and de Farias. Besides evaluating the performance of the cuts, we evaluate the effect of formulation on the performance of branch-and-cut. Finally, we report and analyze results on piecewise linear optimization problems with semi-continuous constraints.
Original language | English |
---|---|
Pages (from-to) | 75-112 |
Number of pages | 38 |
Journal | Mathematical Programming Computation |
Volume | 5 |
Issue number | 1 |
DOIs | |
State | Published - 2013 |
Keywords
- Branch-and-cut
- Knapsack problem
- Mixed-integer programming
- Piecewise linear optimization
- Polyhedral method
- Semi-continuous variable
- Special ordered set