Skip to main content
SpringerLink
Log in

A brief history of lift-and-project

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Balas, E. (1971). “Intersection Cuts—A New Type of Cutting Planes for Integer Programming.” Operations Research, 19, 19–39.

    Google Scholar 

  • Balas, E. (1979). “Disjunctive Programming.” Annals of Discrete Mathematics, 5, 3–51.

    Article  Google Scholar 

  • Balas, E., S. Ceria, and G. Cornuéjols. (1993a). “A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs.” Mathematical Programming, 58, 295–324.

    Article  Google Scholar 

  • Balas, E., S. Ceria, and G. Cornuéjols. (1993b). “Solving Mixed 0-1 Programs by a Lift-and-Project Method.” In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 232–242.

  • Balas, E., S. Ceria, and G. Cornuéjols. (1996a). “Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework.” Management Science, 42, 1229–1246.

    Article  Google Scholar 

  • Balas, E., S. Ceria, G. Cornuéjols, and N.R. Natraj. (1996b). “Gomory Cuts Revisited.” Operation Research Letter, 19, 1–9.

    Article  Google Scholar 

  • Balas, E. and R. Jeroslow. (1980). “Strengthening Cuts for Mixed Integer Programs.” European Journal of Operations Research, 4, 224–234.

    Article  Google Scholar 

  • Jeroslow, R. (1980). “A cutting plane game for facial disjunctive programs.” SIAM J. Control and Optimization 18, 264–280.

    Article  Google Scholar 

  • Lovász, L. and A. Schrijver. (1991). “Cones of Matrices and Set-Functions and 0-1 Optimization.” SIAM J. Optimization, 1, 166–190.

    Article  Google Scholar 

  • Sherali, H. and W. Adams. (1990). “A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-one Programming Problems.” SIAM J. Disc. Math., 3, 411–430.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Axioma, Inc., New York, NY, 10011, USA

    Sebastián Ceria (Chief Executive Officer)

Authors
  1. Sebastián Ceria
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sebastián Ceria.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ceria, S. A brief history of lift-and-project. Ann Oper Res 149, 57–61 (2007). https://doi.org/10.1007/s10479-006-0103-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0103-y

Keywords

Search

Navigation