About the Structure of the Integer Cone and its Application to Bin Packing
From MaRDI portal
Publication:4575846
DOI10.1137/1.9781611974782.103zbMath1410.90178OpenAlexW2951364386MaRDI QIDQ4575846
Kim-Manuel Klein, Klaus Jansen
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974782.103
Analysis of algorithms (68W40) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
New Algorithmic Results for Bin Packing and Scheduling ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Combinatorial \(n\)-fold integer programming and applications ⋮ Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines ⋮ Unnamed Item ⋮ Parameterized complexity of machine scheduling: 15 open problems
This page was built for publication: About the Structure of the Integer Cone and its Application to Bin Packing
