Solving integer and disjunctive programs by lift and project
From MaRDI portal
Recommendations
Cited in
(14)- A modified lift-and-project procedure
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Lift-and-project for general two-term disjunctions
- Disjunctive cuts for mixed integer nonlinear programming problems
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- An in-out approach to disjunctive optimization
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
- On the separation of disjunctive cuts
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- On disjunctive cuts for combinatorial optimization
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Lift-and-project for mixed 0-1 programming: recent progress
- Projection, lifting and extended formulation integer and combinatorial optimization
This page was built for publication: Solving integer and disjunctive programs by lift and project
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840365)
