A computational study of the cutting plane tree algorithm for general mixed-integer linear programs

Binyuan Chen, Simge Kucukyavuz, Suvrajeet Sen*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)15-19
Number of pages5
JournalOperations Research Letters
Volume40
Issue number1
DOIs
StatePublished - Jan 2012

Keywords

  • Cutting plane algorithm
  • Multi-term disjunctions

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A computational study of the cutting plane tree algorithm for general mixed-integer linear programs'. Together they form a unique fingerprint.

Cite this