Relations between facets of low- and high-dimensional group problems
From MaRDI portal
Publication:964183
DOI10.1007/s10107-009-0303-8zbMath1194.90062OpenAlexW2031068814MaRDI QIDQ964183
Santanu S. Dey, Jean-Philippe P. Richard
Publication date: 15 April 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0303-8
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Theoretical challenges towards cutting-plane selection ⋮ A 3-slope theorem for the infinite relaxation in the plane ⋮ 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 ⋮ Design and verify: a new scheme for generating cutting-planes ⋮ Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\) ⋮ Extreme functions with an arbitrary number of slopes ⋮ The strength of multi-row aggregation cuts for sign-pattern integer programs ⋮ 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
- Unnamed Item
- Unnamed Item
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Non-standard approaches to integer programming
- Cutting planes in integer and mixed integer programming
- On the extreme inequalities of infinite group problems
- Mixed-integer cuts from cyclic groups
- On the strength of Gomory mixed-integer cuts as group cuts
- Valid inequalities for mips and group polyhedra from approximate liftings
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cyclic group and knapsack facets
- Some polyhedra related to combinatorial problems
- Valid inequalities based on simple mixed-integer sets
- Two-Step MIR Inequalities for Mixed Integer Programs
- New inequalities for finite and infinite group problems from approximate lifting
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Facets of Two-Dimensional Infinite Group Problems
- Sequential-Merge Facets for Two-Dimensional Group Problems
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
This page was built for publication: Relations between facets of low- and high-dimensional group problems
