Corner polyhedra and their connection with cutting planes

DOI10.1007/s10107-003-0388-4zbMath1082.90145OpenAlexW1971441351MaRDI QIDQ1424273

Lisa Evans, 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-0388-4

zbMATH Keywords

integer programmingcutting planesfacetscorner polyhedragroup relaxation

Mathematics Subject Classification ID

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 (34)

Primal-dual simplex method for shooting ⋮ A concise characterization of strong knapsack facets ⋮ 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 ⋮ Cyclic group blocking polyhedra ⋮ On a generalization of the master cyclic group polyhedron ⋮ On the minimum cost multiple-source unsplittable flow problem ⋮ Vertex Structure of Master Corner Polyhedra ⋮ On the strength of Gomory mixed-integer cuts as group cuts ⋮ Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes ⋮ How tight is the corner relaxation? ⋮ Polarity and the complexity of the shooting experiment ⋮ The worst case analysis of strong knapsack facets ⋮ Quadratic cone cutting surfaces for quadratic programs with on-off constraints ⋮ Relations between facets of low- and high-dimensional group problems ⋮ Valid inequalities based on the interpolation procedure ⋮ Unnamed Item ⋮ Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra ⋮ Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions ⋮ Local cuts revisited ⋮ Extreme functions with an arbitrary number of slopes ⋮ Valid inequalities for mips and group polyhedra from approximate liftings ⋮ IFORS' Operational Research Hall of Fame ⋮ Valid inequalities based on simple mixed-integer sets ⋮ Airline crew scheduling: state-of-the-art ⋮ Light on the infinite group relaxation. I: Foundations and taxonomy

This page was built for publication: Corner polyhedra and their connection with cutting planes