Article ID Journal Published Year Pages File Type
1143130 Operations Research Letters 2012 5 Pages PDF
Abstract
The cutting plane tree algorithm provides a finite procedure for solving general mixed-integer linear programs with bounded integer variables. The computational evidence provided in this work illustrates that this algorithm is powerful enough to close a significant fraction of the integrality gap for moderately sized MIPLIB instances.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
Authors
, , ,