Reflections on generating (disjunctive) cuts

DOI10.1007/s13675-012-0006-4zbMath1305.90345OpenAlexW2079770765MaRDI QIDQ458126

Claude Lemaréchal, Florent Cadoux

Publication date: 30 September 2014

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-012-0006-4

zbMATH Keywords

cutting planesseparationpolarity

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex functions and convex programs in convex geometry (52A41)

Related Items

Reformulating the disjunctive cut generating linear program, Disjunctive cuts in mixed-integer conic optimization, Improved semidefinite bounding procedure for solving max-cut problems to optimality, Target Cuts from Relaxed Decision Diagrams

Cites Work

• Unnamed Item
• Unnamed Item
• Computing deep facet-defining disjunctive cuts for mixed-integer programming
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
• A cutting-plane algorithm with linear and geometric rates of convergence
• A Cholesky dual method for proximal piecewise linear programming
• 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
• A convex-analysis perspective on disjunctive cuts
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• An In-Out Approach to Disjunctive Optimization
• A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
• Finding the nearest point in A polytope
• Disjunctive Programming
• Fenchel Cutting Planes for Integer Programs