, Volume 5, Issue 1, pp 75-112
Date: 08 Nov 2012

Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.