@article{b96f801e7eab42b5b73ec331891d01c2,
title = "Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints",
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.",
keywords = "Branch-and-cut, Knapsack problem, Mixed-integer programming, Piecewise linear optimization, Polyhedral method, Semi-continuous variable, Special ordered set",
author = "{de Farias}, {I. R.} and E. Kozyreff and R. Gupta and M. Zhao",
note = "Funding Information: Acknowledgments This research was partially supported by the Office of Naval Research and the National Science Foundation through grants N000140910332 and CMMI-0620755, respectively. Their support is gratefully acknowledged. We are grateful to George Nemhauser and Juan-Pablo Vielma for making available to us the instances of their paper [30]. We are also grateful to Zhonghao Gu and Ed Rothberg for enlightening discussions. Finally, we are grateful to the anonymous referees and the editors, for several valuable suggestions.",
year = "2013",
month = mar,
doi = "10.1007/s12532-012-0049-9",
language = "English",
volume = "5",
pages = "75--112",
journal = "Mathematical Programming Computation",
issn = "1867-2949",
number = "1",
}