On the separation of disjunctive cuts
From MaRDI portal
Publication:543404
DOI10.1007/S10107-009-0300-YzbMATH Open1218.90125OpenAlexW2042403815MaRDI QIDQ543404FDOQ543404
Authors: Matteo Fischetti, Andrea Lodi, Andrea Tramontani 
Publication date: 17 June 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0300-y
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- Strengthening cuts for mixed integer programs
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Disjunctive programming: Properties of the convex hull of feasible points
- Disjunctive Programming
- Optimizing over the first Chvátal closure
- Lift-and-project for mixed 0-1 programming: recent progress
- Optimizing over the split closure
- Edmonds polytopes and a hierarchy of combinatorial problems
- Chvátal closures for mixed integer programming problems
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- On the MIR Closure of Polyhedra
- A modified lift-and-project procedure
Cited In (31)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- Bilevel programming and the separation problem
- 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
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Title not available (Why is that?)
- On disjunctive cuts for combinatorial optimization
- Implementing automatic benders decomposition in a modern MIP solver
- On dijoins
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Reflections on generating (disjunctive) cuts
- Title not available (Why is that?)
- 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
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
- 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
- Generalized intersection cuts and a new cut generating paradigm
Uses Software
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)
