Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
From MaRDI portal
Publication:384805
DOI10.1007/s12532-011-0028-6zbMath1276.90040OpenAlexW2001634654MaRDI QIDQ384805
Giacomo Nannicini, Cornuéjols, Gérard
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
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
On optimizing over lift-and-project closures, Split cuts from sparse disjunctions, Lattice Reformulation Cuts, Strong IP formulations need large coefficients
Uses Software
Cites Work
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Improved strategies for branching on general disjunctions
- Testing cut generators for mixed-integer linear programming
- MIR closures of polyhedral sets
- Chvátal closures for mixed integer programming problems
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- Strengthening cuts for mixed integer programs
- Factoring polynomials with rational coefficients
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- MIPLIB 2003
- Optimizing over the split closure
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
- Integer Programming and Pricing
- Disjunctive Programming
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
