Recommendations
Cites work
- A modified lift-and-project procedure
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Chvátal closures for mixed integer programming problems
- Disjunctive Programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Edmonds polytopes and a hierarchy of combinatorial problems
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- Lift-and-project for mixed 0-1 programming: recent progress
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- On the MIR Closure of Polyhedra
- Optimizing over the first Chvátal closure
- Optimizing over the split closure
- Strengthening cuts for mixed integer programs
Cited in
(31)- Generalized intersection cuts and a new cut generating paradigm
- Bilevel programming and the separation problem
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- Reformulating the disjunctive cut generating linear program
- A convex-analysis perspective on disjunctive cuts
- An L-shaped method with strengthened lift-and-project cuts
- ``Facet separation with one linear program
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Lift-and-project cuts for mixed integer convex programs
- scientific article; zbMATH DE number 1757966 (Why is no real title available?)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Implementing automatic benders decomposition in a modern MIP solver
- On disjunctive cuts for combinatorial optimization
- On dijoins
- Reflections on generating (disjunctive) cuts
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- scientific article; zbMATH DE number 913208 (Why is no real title available?)
- Lattice reformulation cuts
- Disjunctive cuts in mixed-integer conic optimization
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Split cuts from sparse disjunctions
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Using symmetry to optimize over the Sherali-Adams relaxation
- Computational experiments with cross and crooked cross cuts
- An in-out approach to disjunctive optimization
- Enhanced mixed integer programming techniques and routing problems
- On optimizing over lift-and-project closures
- Cutting planes from two-term disjunctions
This page was built for publication: On the separation of disjunctive cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543404)
