Computing with multi-row gomory cuts

DOI10.1016/j.orl.2009.10.016zbMath1185.90157OpenAlexW2028211081MaRDI QIDQ969515

Daniel G. Espinoza

Publication date: 7 May 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/141706

zbMATH Keywords

mixed integer programmingcutting planesmultiple constraints

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Multirow Intersection Cuts Based on the Infinity Norm, Partial hyperplane activation for generalized intersection cuts, Computational Experiments with Cross and Crooked Cross Cuts, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, An algorithm for the separation of two-row cuts, Can Cut-Generating Functions Be Good and Efficient?, A Probabilistic Analysis of the Strength of the Split and Triangle Closures, Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation, The (not so) trivial lifting in two dimensions, The strength of multi-row models, Minimal cut-generating functions are nearly extreme

Uses Software

• MIPLIB
• CPLEX
• MIPLIB2003

Cites Work

• Chvátal closures for mixed integer programming problems
• Cook, Kannan and Schrijver's example revisited
• On the facets of mixed integer programs with two integer variables and two constraints
• MIPLIB 2003
• Computing with Multi-row Gomory Cuts
• Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
• Inequalities from Two Rows of a Simplex Tableau
• Some continuous functions related to corner polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item