Multirow Intersection Cuts Based on the Infinity Norm

DOI10.1287/ijoc.2020.1027OpenAlexW3134425920WikidataQ114058190 ScholiaQ114058190MaRDI QIDQ5084619

Álinson S. Xavier, Ricardo Fukasawa, Laurent Poirrier

Publication date: 28 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2020.1027

zbMATH Keywords

intersection cutscutting-plane methodmixed integer linear programming (MIP)

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts

Uses Software

• lifting

Cites Work

• Unnamed Item
• Testing cut generators for mixed-integer linear programming
• Computing with multi-row gomory cuts
• A proof of Lovász's theorem on maximal lattice-free sets
• The (not so) trivial lifting in two dimensions
• An algorithm for the separation of two-row cuts
• Optimizing over the split closure
• The strength of multi-row models
• Some polyhedra related to combinatorial problems
• Experiments with Two-Row Cuts from Degenerate Tableaux
• On the Practical Strength of Two-Row Tableau Cuts
• Maximal Lattice-Free Convex Sets in Linear Subspaces
• Integer Programming
• Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
• Experiments with Two Row Tableau Cuts
• Can Cut-Generating Functions Be Good and Efficient?
• Cut-Generating Functions and S-Free Sets
• Inequalities from Two Rows of a Simplex Tableau
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming

This page was built for publication: Multirow Intersection Cuts Based on the Infinity Norm