A $(k+1)$-Slope Theorem for the $k$-Dimensional Infinite Group Relaxation

DOI10.1137/110848608zbMath1300.90017arXiv1109.4184OpenAlexW2153331513MaRDI QIDQ2848184

Marco Molinaro, Amitabh Basu, Robert Hildebrand, Matthias Köppe

Publication date: 25 September 2013

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.4184

zbMATH Keywords

integer programmingcutting planesinfinite group relaxation3-slope theorem

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11)

Related Items (17)

A concise characterization of strong knapsack facets ⋮ Theoretical challenges towards cutting-plane selection ⋮ A few strong knapsack facets ⋮ Lifting properties of maximal lattice-free polyhedra ⋮ Approximation of Minimal Functions by Extreme Functions ⋮ The worst case analysis of strong knapsack facets ⋮ Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\) ⋮ Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem ⋮ An extreme function which is nonnegative and discontinuous everywhere ⋮ Extreme functions with an arbitrary number of slopes ⋮ Minimal cut-generating functions are nearly extreme ⋮ The strength of multi-row aggregation cuts for sign-pattern integer programs ⋮ Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations ⋮ Maximal $S$-Free Convex Sets and the Helly Number ⋮ Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case ⋮ A geometric approach to cut-generating functions ⋮ Light on the infinite group relaxation. I: Foundations and taxonomy

This page was built for publication: A $(k+1)$-Slope Theorem for the $k$-Dimensional Infinite Group Relaxation