Mathematical Programming Computation, Volume 5, Issue 1, March 2013
Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
I. R. de Farias Jr, E. Kozyreff, R. Gupta, M. Zhao
We report and analyze the results of our computational testing of branchand-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.
Full Text: PDF
Imprint and privacy statement
For the imprint and privacy statement we refer to the Imprint of ZIB.
© 2008-2020 by Zuse Institute Berlin (ZIB).