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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have