Computing deep facet-defining disjunctive cuts for mixed-integer programming
From MaRDI portal
Publication:847850
DOI10.1007/s10107-008-0245-6zbMath1184.90105OpenAlexW1975568778MaRDI QIDQ847850
Publication date: 19 February 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0245-6
Related Items
Reformulating the disjunctive cut generating linear program, A note on the selection of Benders' cuts, Theoretical challenges towards cutting-plane selection, Two-term disjunctions on the second-order cone, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs, Reflections on generating (disjunctive) cuts, How to convexify the intersection of a second order cone and a nonconvex quadratic, Mixed integer programming with a class of nonlinear convex constraints, Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization, ``Facet separation with one linear program
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branching on general disjunctions
- Valid inequalities for mixed integer linear programs
- Strengthening cuts for mixed integer programs
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Convex normalizations in lift-and-project methods for 0--1 programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A convex-analysis perspective on disjunctive cuts
- Finding the nearest point in A polytope
- Disjunctive Programming
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- Fenchel Cutting Planes for Integer Programs
- On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
