Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case
From MaRDI portal
Publication:5245017
DOI10.1287/moor.2014.0660zbMath1308.90106arXiv1206.2079OpenAlexW3100481657MaRDI QIDQ5245017
Robert Hildebrand, Matthias Köppe, Amitabh Basu
Publication date: 1 April 2015
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.2079
integer programmingcutting planesminimal and extreme functionsinfinite group relaxationcut generating functions
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Semi-infinite programming (90C34)
Related Items
Theoretical challenges towards cutting-plane selection, Structure and interpretation of dual-feasible functions, New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem, Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case, Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\), Equivariant perturbation in Gomory and Johnson's infinite group problem. VI: The curious case of two-sided discontinuous minimal valid functions, 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, Piecewise smooth extreme functions are piecewise linear, Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond, Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations, Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems, Equivariant perturbation in Gomory and Johnson's infinite group problem. VII: Inverse semigroup theory, closures, decomposition of perturbations, A geometric approach to cut-generating functions, Light on the infinite group relaxation. I: Foundations and taxonomy
Cites Work
- A counterexample to a conjecture of Gomory and Johnson
- On the relative strength of split, triangle and quadrilateral cuts
- Relations between facets of low- and high-dimensional group problems
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
- Valid inequalities for mips and group polyhedra from approximate liftings
- T-space and cutting planes
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- On the facets of mixed integer programs with two integer variables and two constraints
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- A 3-slope theorem for the infinite relaxation in the plane
- An algorithm for the separation of two-row cuts
- Some polyhedra related to combinatorial problems
- Gomory cuts revisited
- A $(k+1)$-Slope Theorem for the $k$-Dimensional Infinite Group Relaxation
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- Minimal Valid Inequalities for Integer Constraints
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- New inequalities for finite and infinite group problems from approximate lifting
- On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows
- Equivariant Perturbation in Gomory and Johnson’s Infinite Group Problem: II. The Unimodular Two-Dimensional Case
- Facets of Two-Dimensional Infinite Group Problems
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
