Valid inequalities for mips and group polyhedra from approximate liftings
From MaRDI portal
Publication:1016121
DOI10.1007/s10107-007-0190-9zbMath1171.90006OpenAlexW2095053645MaRDI QIDQ1016121
Jean-Philippe P. Richard, Yanjun Li, Lisa A. Miller
Publication date: 4 May 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0190-9
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
On the extreme inequalities of infinite group problems, Two row mixed-integer cuts via lifting, Theoretical challenges towards cutting-plane selection, New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem, The master equality polyhedron with multiple rows, Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case, 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\), Equivariant perturbation in Gomory and Johnson's infinite group problem. VI: The curious case of two-sided discontinuous minimal valid functions, Relations between facets of low- and high-dimensional group problems, 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, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs, Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond, 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, Light on the infinite group relaxation. I: Foundations and taxonomy
Cites Work
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cyclic group and knapsack facets
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- Sequence independent lifting in mixed integer programming
- Valid inequalities based on the interpolation procedure
- Some polyhedra related to combinatorial problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
- Integer Programming and Pricing
- Sequence Independent Lifting for Mixed-Integer Programming
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- On the facial structure of set packing polyhedra
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Unnamed Item
- Unnamed Item
