T-space and cutting planes
From MaRDI portal
Publication:1424274
DOI10.1007/s10107-003-0389-3zbMath1082.90144OpenAlexW2058732533MaRDI QIDQ1424274
Ralph E. Gomory, Ellis L. Johnson
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0389-3
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
On the extreme inequalities of infinite group problems, Origin and early evolution of corner polyhedra, Two row mixed-integer cuts via lifting, Extended formulations for Gomory corner polyhedra, Theoretical challenges towards cutting-plane selection, Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra, Mixed-integer cuts from cyclic groups, New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem, A few strong knapsack facets, Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles, Optimal Cutting Planes from the Group Relaxations, The master equality polyhedron with multiple rows, On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets, A counterexample to a conjecture of Gomory and Johnson, A 3-slope theorem for the infinite relaxation in the plane, On a generalization of the master cyclic group polyhedron, Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case, How tight is the corner relaxation?, The worst case analysis of strong knapsack facets, Some cut-generating functions for second-order conic sets, Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\), Relations between facets of low- and high-dimensional group problems, The atoms of integer programming, Valid inequalities based on the interpolation procedure, Equivalence between intersection cuts and the corner polyhedron, Unnamed Item, Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem, An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem, Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions, Piecewise smooth extreme functions are piecewise linear, An extreme function which is nonnegative and discontinuous everywhere, Extreme functions with an arbitrary number of slopes, Minimal cut-generating functions are nearly extreme, Valid inequalities for mips and group polyhedra from approximate liftings, Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond, IFORS' Operational Research Hall of Fame, Cut-Generating Functions for Integer Variables, Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems, Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case, Valid inequalities based on simple mixed-integer sets, A geometric approach to cut-generating functions, Airline crew scheduling: state-of-the-art, Light on the infinite group relaxation. I: Foundations and taxonomy
