Recommendations
- Lift-and-project for mixed 0-1 programming: recent progress
- scientific article; zbMATH DE number 437548
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- scientific article; zbMATH DE number 1187158
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- 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
- Computational experience with parallel mixed integer programming in a distributed environment
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Convex programming for disjunctive convex optimization
- Disjunctive Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- scientific article; zbMATH DE number 956840 (Why is no real title available?)
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
Cited in
(24)- Local cuts revisited
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Lift-and-project cuts for convex mixed integer nonlinear programs
- A new lift-and-project operator
- Convex normalizations in lift-and-project methods for 0--1 programming
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Elevators for degenerations of PEL structures
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- scientific article; zbMATH DE number 437548 (Why is no real title available?)
- When Lift-and-Project Cuts Are Different
- Two-stage stochastic mixed-integer programs: algorithms and insights
- scientific article; zbMATH DE number 1187158 (Why is no real title available?)
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Implementing automatic benders decomposition in a modern MIP solver
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
- On the separation of disjunctive cuts
- Lift-and-project for mixed 0-1 programming: recent progress
- Last fifty years of integer linear programming: a focus on recent practical advances
- Projection, lifting and extended formulation integer and combinatorial optimization
- Reformulating the disjunctive cut generating linear program
This page was built for publication: A modified lift-and-project procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365045)
