Abstract.
We review classical valid linear inequalities for mixed-integer programming, i.e., Gomory's fractional and mixed-integer cuts, and discuss their use in branch-and-cut. In particular, a generalization of the recent mixed-integer rounding (MIR) inequality and a sufficient condition for the global validity of classical cuts after branching has occurred are derived.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Manuscript received: February 2000/Final version received: November 2000
Rights and permissions
About this article
Cite this article
Padberg, M. Classical cuts for mixed-integer programming and branch-and-cut. Mathematical Methods of OR 53, 173–203 (2001). https://doi.org/10.1007/s001860100120
Issue Date:
DOI: https://doi.org/10.1007/s001860100120