Experiments with Two-Row Cuts from Degenerate Tableaux

DOI10.1287/ijoc.1100.0437zbMath1243.90143arXiv1701.06589OpenAlexW2113612338MaRDI QIDQ2899149

Cornuéjols, Gérard, Pierre Bonami, Amitabh Basu, Margot, François

Publication date: 28 July 2012

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

Full work available at URL: https://arxiv.org/abs/1701.06589

zbMATH Keywords

cutting planesmixed-integer programming\texttt{MIPLIB}

Mathematics Subject Classification ID

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

Related Items

Intersection cuts for single row corner relaxations, Theoretical challenges towards cutting-plane selection, Multirow Intersection Cuts Based on the Infinity Norm, Partial hyperplane activation for generalized intersection cuts, Computational Experiments with Cross and Crooked Cross Cuts, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, On the Practical Strength of Two-Row Tableau Cuts, An algorithm for the separation of two-row cuts, Intersection cuts from multiple rows: a disjunctive programming approach, Can Cut-Generating Functions Be Good and Efficient?, A Probabilistic Analysis of the Strength of the Split and Triangle Closures, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, The (not so) trivial lifting in two dimensions, The strength of multi-row models, When Lift-and-Project Cuts Are Different, A geometric approach to cut-generating functions

Uses Software

• MIPLIB