[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content

Advertisement

Log in

Classical cuts for mixed-integer programming and branch-and-cut

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Manuscript received: February 2000/Final version received: November 2000

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860100120

Navigation