Depth-optimized convexity cuts

DOI10.1007/S10479-005-3445-YzbMATH Open1091.90047OpenAlexW1986520459MaRDI QIDQ817181FDOQ817181

Authors: 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

Recommendations

• How to extend the concept of convexity cuts to derive deeper cutting planes
• Computing deep facet-defining disjunctive cuts for mixed-integer programming
• Lift-and-project cuts for mixed integer convex programs
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
• Cuts for mixed 0-1 conic programming

zbMATH Keywords

integer programmingcutting planesconvexity cuts

Mathematics Subject Classification ID

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

Cites Work

• Convex Analysis
• Strengthening cuts for mixed integer programs
• 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
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Title not available (Why is that?)
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• Title not available (Why is that?)
• A disjunctive cutting plane procedure for general mixed-integer linear programs
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• Integer programming and convex analysis: Intersection cuts from outer polars
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• Elementary closures for integer programs.
• Convexity Cuts and Cut Search
• An Intersection Cut from the Dual of the Unit Hypercube

Cited In (6)

• Title not available (Why is that?)
• Adaptive cut selection in mixed-integer linear programming
• Partial hyperplane activation for generalized intersection cuts
• Enabling cuts on multiresolution representation
• Title not available (Why is that?)
• Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets

Uses Software

• MIPLIB

This page was built for publication: Depth-optimized convexity cuts

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