Practical strategies for generating rank-1 split cuts in mixed-integer linear programming

DOI10.1007/S12532-011-0028-6MaRDI QIDQ384805zbMATHOpenAlexFDO

Authors Giacomo Nannicini, Gérard Cornuéjols

Publication date 28 November 2013

Published in Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12532-011-0028-6

Mathematics Subject Classification ID

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

Recommendations

• Optimizing over the split closure
• A heuristic to generate rank-1 GMI cuts
• A note on the split rank of intersection cuts
• A relax-and-cut framework for Gomory's mixed-integer cuts
• Split cuts from sparse disjunctions

Cites work

• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 1775383 (Why is no real title available?)
• scientific article; zbMATH DE number 274379 (Why is no real title available?)
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Chvátal closures for mixed integer programming problems
• Disjunctive Programming
• Factoring polynomials with rational coefficients
• Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
• Improved strategies for branching on general disjunctions
• Integer Programming and Pricing
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• MIPLIB 2003
• MIR closures of polyhedral sets
• Optimizing over the split closure
• Progress in computational mixed integer programming -- a look back from the other side of the tipping point
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
• Strengthening cuts for mixed integer programs
• Testing cut generators for mixed-integer linear programming

Cited in

(10)

• Testing cut generators for mixed-integer linear programming
• Optimizing over the split closure
• Split cuts from sparse disjunctions
• On optimizing over lift-and-project closures
• Lattice reformulation cuts
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
• Cut generation through binarization
• Cut generation through binarization
• Strong IP formulations need large coefficients
• A heuristic to generate rank-1 GMI cuts

Describes a project that uses

Uses Software

• MIPLIB
• CPLEX
• Cbc
• CLP
• MIPLIB2003
• Cgl

This page was built for publication: Practical strategies for generating rank-1 split cuts in mixed-integer linear programming

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