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

  • 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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:I. R. de Farias, E. Kozyreff, R. Gupta, M. Zhao
DOI:https://doi.org/10.1007/s12532-012-0049-9
ISSN:1867-2949
Parent Title (English):Mathematical Programming Computation
Publisher:Springer Science and Business Media LLC
Document Type:Article
Language:English
Year of Completion:2012
Tag:Software; Theoretical Computer Science
Volume:5
Issue:1
Page Number:38
First Page:75
Last Page:112
Mathematical Programming Computation :MPC 2013 - Issue 1
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.