A brief history of lift-and-project

DOI10.1007/S10479-006-0103-YzbMATH Open1213.90014OpenAlexW2068906445MaRDI QIDQ537586FDOQ537586

Authors: Sebastián Ceria 

Publication date: 20 May 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-006-0103-y

Mathematics Subject Classification ID

Integer programming (90C10) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)

Cites Work

• Strengthening cuts for mixed integer programs
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Gomory cuts revisited
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Disjunctive Programming
• Title not available (Why is that?)
• A Cutting-Plane Game for Facial Disjunctive Programs

This page was built for publication: A brief history of lift-and-project

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537586)