Intersection cuts for single row corner relaxations
From MaRDI portal
Publication:1621696
DOI10.1007/s12532-018-0132-yzbMath1402.90097OpenAlexW2794432621MaRDI QIDQ1621696
Laurent Poirrier, Ricardo Fukasawa, Álinson S. Xavier
Publication date: 9 November 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-018-0132-y
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (4)
Intersection cuts for single row corner relaxations ⋮ Can Cut-Generating Functions Be Good and Efficient? ⋮ onerow ⋮ The aggregation closure is polyhedral for packing and covering integer programs
Uses Software
Cites Work
- Unnamed Item
- Composite lifting of group inequalities and an application to two-row mixing inequalities
- Strengthening lattice-free cuts using non-negativity
- On the exact separation of mixed integer knapsack cuts
- Lifting two-integer knapsack inequalities
- Chvátal closures for mixed integer programming problems
- On the strength of Gomory mixed-integer cuts as group cuts
- Strengthening cuts for mixed integer programs
- On integer points in polyhedra
- Intersection cuts for single row corner relaxations
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Generalized intersection cuts and a new cut generating paradigm
- On the facets of mixed integer programs with two integer variables and two constraints
- An algorithm for the separation of two-row cuts
- Description of 2-integer continuous knapsack polyhedra
- The strength of multi-row models
- Some polyhedra related to combinatorial problems
- Gomory cuts revisited
- Two row mixed-integer cuts via lifting
- Two-Step MIR Inequalities for Mixed Integer Programs
- 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
- Integer Programming
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- On Lifting Integer Variables in Minimal Inequalities
- Mixed-Integer Cuts from Cyclic Groups
- Aggregation and Mixed Integer Rounding to Solve MIPs
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- Computing Two-Dimensional Integer Hulls
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- 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
- Some continuous functions related to corner polyhedra, II
This page was built for publication: Intersection cuts for single row corner relaxations
