Reflections on generating (disjunctive) cuts

DOI10.1007/S13675-012-0006-4MaRDI QIDQ458126zbMATH OpenOpenAlexFDO

Authors Florent Cadoux, Claude Lemaréchal

Publication date 30 September 2014

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

cutting planesseparationpolarity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1757966
• On the separation of disjunctive cuts
• Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
• Generating cut conjunctions in graphs and related problems
• A convex-analysis perspective on disjunctive cuts
• On disjunctive cuts for combinatorial optimization
• On the rank of disjunctive cuts
• Generalized intersection cuts and a new cut generating paradigm
• scientific article; zbMATH DE number 1114456
• On pathological disjunctions and redundant disjunctive conic cuts

Cites work

• scientific article; zbMATH DE number 1667417 (Why is no real title available?)
• scientific article; zbMATH DE number 1757966 (Why is no real title available?)
• A Cholesky dual method for proximal piecewise linear programming
• A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
• A convex-analysis perspective on disjunctive cuts
• A cutting-plane algorithm with linear and geometric rates of convergence
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• An in-out approach to disjunctive optimization
• Computing deep facet-defining disjunctive cuts for mixed-integer programming
• Disjunctive Programming
• Fenchel Cutting Planes for Integer Programs
• Finding the nearest point in A polytope
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

Cited in

(5)

• Improved semidefinite bounding procedure for solving max-cut problems to optimality
• Reformulating the disjunctive cut generating linear program
• scientific article; zbMATH DE number 1757966 (Why is no real title available?)
• Target cuts from relaxed decision diagrams
• Disjunctive cuts in mixed-integer conic optimization

This page was built for publication: Reflections on generating (disjunctive) cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458126)