Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
From MaRDI portal
Publication:3115940
DOI10.1287/mnsc.1050.0382zbMath1232.90310OpenAlexW1976440936MaRDI QIDQ3115940
Cornuéjols, Gérard, Yanjun Li, Kent Andersen
Publication date: 21 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.1050.0382
Related Items
Integer programming techniques for the nurse rostering problem, Characterization of the split closure via geometric lifting, Theoretical challenges towards cutting-plane selection, On optimizing over lift-and-project closures, DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips, Practical strategies for generating rank-1 split cuts in mixed-integer linear programming, A heuristic to generate rank-1 GMI cuts, On the Practical Strength of Two-Row Tableau Cuts, Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs, Improved strategies for branching on general disjunctions, Branching on general disjunctions, Split closure and intersection cuts, Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts, Valid inequalities for mixed integer linear programs, Testing cut generators for mixed-integer linear programming, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
Uses Software
