Generalized intersection cuts and a new cut generating paradigm

DOI10.1007/s10107-011-0483-xzbMath1262.90099OpenAlexW2104477931MaRDI QIDQ1942255

Egon Balas, Margot, François

Publication date: 18 March 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-011-0483-x

zbMATH Keywords

intersection cutsclosure of intersection cutscutting plane paradigmnonrecursive fashion cuts

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Intersection cuts for single row corner relaxations, A disjunctive cut strengthening technique for convex MINLP, Theoretical challenges towards cutting-plane selection, On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, Intersection Disjunctions for Reverse Convex Sets, Partial hyperplane activation for generalized intersection cuts, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Disjunctive programming and relaxations of polyhedra, Relaxations of mixed integer sets from lattice-free polyhedra, Intersection cuts for convex mixed integer programs from translated cones, Relaxations of mixed integer sets from lattice-free polyhedra, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, Decomposition of loosely coupled integer programs: a multiobjective perspective

Cites Work

• Unnamed Item
• On the separation of disjunctive cuts
• Chvátal closures for mixed integer programming problems
• Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
• 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
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Minimal Valid Inequalities for Integer Constraints
• Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
• Strengthening Gomory Mixed-Integer Cuts
• Inequalities from Two Rows of a Simplex Tableau
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Some continuous functions related to corner polyhedra