An algorithm for the separation of two-row cuts
From MaRDI portal
Publication:2436649
DOI10.1007/s10107-012-0597-9zbMath1285.90019OpenAlexW2095867763MaRDI QIDQ2436649
Quentin Louveaux, Laurent Poirrier
Publication date: 25 February 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0597-9
Related Items (10)
Intersection cuts for single row corner relaxations ⋮ Theoretical challenges towards cutting-plane selection ⋮ Multirow Intersection Cuts Based on the Infinity Norm ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ Can Cut-Generating Functions Be Good and Efficient? ⋮ The (not so) trivial lifting in two dimensions ⋮ The strength of multi-row models ⋮ Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case ⋮ On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs ⋮ A geometric approach to cut-generating functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strengthening lattice-free cuts using non-negativity
- Integer points in polyhedra
- Computing with multi-row gomory cuts
- On the facets of mixed integer programs with two integer variables and two constraints
- MIPLIB 2003
- Some polyhedra related to combinatorial problems
- Mixed-integer sets from two rows of two adjacent simplex bases
- Split Rank of Triangle and Quadrilateral Inequalities
- Experiments with Two-Row Cuts from Degenerate Tableaux
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- A Geometric Perspective on Lifting
- Minimal Valid Inequalities for Integer Constraints
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows
- Experiments with Two Row Tableau Cuts
- Computing Two-Dimensional Integer Hulls
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Inequalities from Two Rows of a Simplex Tableau
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
This page was built for publication: An algorithm for the separation of two-row cuts
