Cites work
- scientific article; zbMATH DE number 437548 (Why is no real title available?)
- A Cutting-Plane Game for Facial Disjunctive Programs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Disjunctive Programming
- Gomory cuts revisited
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Strengthening cuts for mixed integer 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)