A heuristic to generate rank-1 GMI cuts
From MaRDI portal
Publication:621750
DOI10.1007/s12532-010-0018-0zbMath1208.90120OpenAlexW2110152564MaRDI QIDQ621750
Marcos Goycoolea, Sanjeeb Dash
Publication date: 28 January 2011
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-010-0018-0
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
Characterization of the split closure via geometric lifting ⋮ Theoretical challenges towards cutting-plane selection ⋮ On optimizing over lift-and-project closures ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ A computational study of the cutting plane tree algorithm for general mixed-integer linear programs ⋮ How tight is the corner relaxation? Insights gained from the stable set problem ⋮ On the relative strength of different generalizations of split cuts ⋮ Lattice Reformulation Cuts ⋮ A relax-and-cut framework for Gomory mixed-integer cuts ⋮ The strength of multi-row models ⋮ Virtual private network design over the first Chvátal closure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Testing cut generators for mixed-integer linear programming
- MIR closures of polyhedral sets
- Mixed-integer cuts from cyclic groups
- Combinatorial algorithms for computing column space bases that have sparse inverses
- Optimizing over the first Chvátal closure
- On the strength of Gomory mixed-integer cuts as group cuts
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- On the separation of split cuts and related inequalities
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- MIPLIB 2003
- Optimizing over the split closure
- Gomory cuts revisited
- The Elimination form of the Inverse and its Application to Linear Programming
- Numerically Safe Gomory Mixed-Integer Cuts
- Two-Step MIR Inequalities for Mixed Integer Programs
- Grid-Enabled Optimization with GAMS
- Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- Multicommodity Distribution System Design by Benders Decomposition
- On the Exact Separation of Mixed Integer Knapsack Cuts
- Matroids and the greedy algorithm
- Elementary closures for integer programs.
This page was built for publication: A heuristic to generate rank-1 GMI cuts
