Computing with Multi-row Gomory Cuts

DOI10.1007/978-3-540-68891-4_15zbMath1143.90363OpenAlexW1600775442MaRDI QIDQ3503849

Daniel G. Espinoza

Publication date: 10 June 2008

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

Theoretical challenges towards cutting-plane selection ⋮ On the relative strength of split, triangle and quadrilateral cuts ⋮ On the Practical Strength of Two-Row Tableau Cuts ⋮ Strengthening lattice-free cuts using non-negativity ⋮ A note on the split rank of intersection cuts ⋮ Computing with multi-row gomory cuts ⋮ Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra ⋮ On degenerate multi-row Gomory cuts ⋮ When Lift-and-Project Cuts Are Different

Uses Software

• MIPLIB

Cites Work

• Chvátal closures for mixed integer programming problems
• Branching rules revisited
• MIPLIB 2003
• Minimal Valid Inequalities for Integer Constraints
• A Computational Study of Search Strategies for Mixed Integer Programming
• Inequalities from Two Rows of a Simplex Tableau
• On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
• Some continuous functions related to corner polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing with Multi-row Gomory Cuts