Intersection cuts -- standard versus restricted

DOI10.1016/j.disopt.2015.10.001zbMath1387.90151OpenAlexW1939682572MaRDI QIDQ1751139

Tamás Kis, Egon Balas

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.10.001

zbMATH Keywords

cutintersectionMIP

Mathematics Subject Classification ID

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

Related Items

On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, Erratum to ``Intersection cuts -- standard versus restricted

Cites Work

• Equivalence between intersection cuts and the corner polyhedron
• Constrained Infinite Group Relaxations of MIPs
• Minimal Inequalities for an Infinite Relaxation of Integer Programs
• Inequalities from Two Rows of a Simplex Tableau
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Integer programming and convex analysis: Intersection cuts from outer polars