|Original language||English (US)|
|Title of host publication||Wiley Encyclopedia of Operations Research and Management Science|
|Editors||James J Cochran, Louis A Cox Jr, Pinar Keskinocak, Jeffrey P Kharoufeh, J Cole Smith|
|Publisher||John Wiley & Sons, Inc.|
|State||Published - 2013|
Cutting‐plane methods solve a mixed‐integer program (MIP) by iteratively adding a valid linear inequality that violates a fractional solution of a linear relaxation of the problem. This article surveys cutting‐plane algorithms for different subclasses of MIPs and addresses whether these algorithms converge to an optimal solution of MIP in finitely many steps.
Gade, D., & Kucukyavuz, S. (2013). Pure Cutting‐Plane Algorithms and their Convergence. In J. J. Cochran, L. A. Cox Jr, P. Keskinocak, J. P. Kharoufeh, & J. C. Smith (Eds.), Wiley Encyclopedia of Operations Research and Management Science John Wiley & Sons, Inc..