The strength of multi-row models
From MaRDI portal
Publication:2516350
DOI10.1007/s12532-014-0076-9zbMath1327.90139OpenAlexW1976836184MaRDI QIDQ2516350
Laurent Poirrier, Quentin Louveaux, Domenico Salvagnin
Publication date: 31 July 2015
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-014-0076-9
Related Items
Reformulating the disjunctive cut generating linear program, Intersection cuts for single row corner relaxations, Multirow Intersection Cuts Based on the Infinity Norm, Partial hyperplane activation for generalized intersection cuts, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Cut generation through binarization, Can Cut-Generating Functions Be Good and Efficient?, The (not so) trivial lifting in two dimensions, When Lift-and-Project Cuts Are Different
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Curvature inequalities for Lagrangian submanifolds: the final solution
- Strengthening lattice-free cuts using non-negativity
- On the exact separation of mixed integer knapsack cuts
- A heuristic to generate rank-1 GMI cuts
- Lift-and-project for mixed 0-1 programming: recent progress
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- Computing with multi-row gomory cuts
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- A relax-and-cut framework for Gomory mixed-integer cuts
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- On the facets of mixed integer programs with two integer variables and two constraints
- Local cuts for mixed-integer programming
- An algorithm for the separation of two-row cuts
- MIPLIB 2003
- Some polyhedra related to combinatorial problems
- Two row mixed-integer cuts via lifting
- 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
- Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms
- Computational Experiments with Cross and Crooked Cross Cuts
- On the Practical Strength of Two-Row Tableau Cuts
- A Probabilistic Analysis of the Strength of the Split and Triangle Closures
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- A Geometric Perspective on Lifting
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Experiments with Two Row Tableau Cuts
- Sequence Independent Lifting for Mixed-Integer Programming
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- 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
