Computing with Multi-row Gomory Cuts
From MaRDI portal
Recommendations
Cites work
- A Computational Study of Search Strategies for Mixed Integer Programming
- Branching rules revisited
- Chvátal closures for mixed integer programming problems
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- scientific article; zbMATH DE number 4119933 (Why is no real title available?)
- Inequalities from Two Rows of a Simplex Tableau
- Minimal valid inequalities for integer constraints
- MIP: Theory and practice -- closing the gap
- MIPLIB 2003
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
- Some continuous functions related to corner polyhedra
Cited in
(16)- On degenerate multi-row Gomory cuts
- Theoretical challenges towards cutting-plane selection
- Numerically safe Gomory mixed-integer cuts
- Experiments with two-row cuts from degenerate tableaux
- Computational experiments with cross and crooked cross cuts
- On the practical strength of two-row tableau cuts
- Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
- When Lift-and-Project Cuts Are Different
- Can Pure Cutting Plane Algorithms Work?
- A relax-and-cut framework for Gomory's mixed-integer cuts
- Strengthening lattice-free cuts using non-negativity
- A heuristic to generate rank-1 GMI cuts
- On the relative strength of split, triangle and quadrilateral cuts
- A note on the split rank of intersection cuts
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- Computing with multi-row gomory cuts
This page was built for publication: Computing with Multi-row Gomory Cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503849)