Intersection cuts for single row corner relaxations

DOI10.1007/S12532-018-0132-YMaRDI QIDQ1621696zbMATH OpenOpenAlexFDO

Authors Ricardo Fukasawa, Laurent Poirrier, Á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

zbMATH Keywords

cutting planesinteger programminglifting

Mathematics Subject Classification ID

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

Recommendations

• Two row mixed-integer cuts via lifting
• Intersection cuts from multiple rows: a disjunctive programming approach
• The strength of multi-row models
• On the practical strength of two-row tableau cuts
• Split rank of triangle and quadrilateral inequalities

Cites work

• A directed cycle-based column-and-cut generation method for capacitated survivable network design
• A geometric perspective on lifting
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• An algorithm for the separation of two-row cuts
• Chvátal closures for mixed integer programming problems
• Composite lifting of group inequalities and an application to two-row mixing inequalities
• Computing Two-Dimensional Integer Hulls
• Description of 2-integer continuous knapsack polyhedra
• Experiments with two-row cuts from degenerate tableaux
• Generalized intersection cuts and a new cut generating paradigm
• Gomory cuts revisited
• scientific article; zbMATH DE number 4119933 (Why is no real title available?)
• Inequalities from Two Rows of a Simplex Tableau
• Integer Programming
• Intersection cuts for single row corner relaxations
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
• Lifting two-integer knapsack inequalities
• Minimal inequalities for an infinite relaxation of integer programs
• Minimal valid inequalities for integer constraints
• Mixed-Integer Cuts from Cyclic Groups
• On integer points in polyhedra
• On lifting integer variables in minimal inequalities
• On the exact separation of mixed integer knapsack cuts
• On the facets of mixed integer programs with two integer variables and two constraints
• On the strength of Gomory mixed-integer cuts as group cuts
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II
• Some polyhedra related to combinatorial problems
• Strengthening cuts for mixed integer programs
• Strengthening lattice-free cuts using non-negativity
• The strength of multi-row models
• Two row mixed-integer cuts via lifting
• Two-step MIR inequalities for mixed integer programs

Cited in

(6)

• Intersection cuts for single row corner relaxations
• The aggregation closure is polyhedral for packing and covering integer programs
• onerow
• Intersection cuts from multiple rows: a disjunctive programming approach
• Can cut-generating functions be good and efficient?
• How tight is the corner relaxation?

Describes a project that uses

Uses Software

• gmp
• MIPLIB
• CPLEX
• lifting

This page was built for publication: Intersection cuts for single row corner relaxations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1621696)