Sequential-Merge Facets for Two-Dimensional Group Problems
From MaRDI portal
Publication:5429255
DOI10.1007/978-3-540-72792-7_3zbMath1136.90519OpenAlexW1501588325MaRDI QIDQ5429255
Jean-Philippe P. Richard, Santanu S. Dey
Publication date: 29 November 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_3
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 ⋮ The master equality polyhedron with multiple rows ⋮ Approximate and exact merging of knapsack constraints with cover inequalities ⋮ 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