Reformulating the disjunctive cut generating linear program
From MaRDI portal
Publication:827289
DOI10.1007/s10479-020-03709-2zbMath1456.90105OpenAlexW3043255943MaRDI QIDQ827289
Publication date: 7 January 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.bucknell.edu/cgi/viewcontent.cgi?article=2882&context=fac_journ
Related Items
A disjunctive cut strengthening technique for convex MINLP ⋮ Disjunctive cuts in mixed-integer conic optimization
Uses Software
Cites Work
- Unnamed Item
- Reflections on generating (disjunctive) cuts
- On the separation of disjunctive cuts
- Lift-and-project for mixed 0-1 programming: recent progress
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- Local cuts revisited
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- Regularizing the abstract convex program
- Disjunctive programming: Properties of the convex hull of feasible points
- 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
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On optimizing over lift-and-project closures
- The strength of multi-row models
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- An Exact Algorithm for Robust Network Design
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- An In-Out Approach to Disjunctive Optimization
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- The Supporting Hyperplane Method for Unimodal Programming
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
