Depth-optimized convexity cuts

DOI10.1007/s10479-005-3445-yzbMath1091.90047OpenAlexW1986520459MaRDI QIDQ817181

Jonathan Eckstein, Mikhail Nediak

Publication date: 7 March 2006

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-005-3445-y

zbMATH Keywords

integer programmingcutting planesconvexity cuts

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Uses Software

• MIPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Strengthening cuts for mixed integer programs
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• 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
• Gomory cuts revisited
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• Convex Analysis
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• An Intersection Cut from the Dual of the Unit Hypercube
• Integer programming and convex analysis: Intersection cuts from outer polars
• Convexity Cuts and Cut Search
• A disjunctive cutting plane procedure for general mixed-integer linear programs
• Elementary closures for integer programs.