About the structure of the integer cone and its application to bin packing
DOI10.1137/1.9781611974782.103zbMATH Open1410.90178OpenAlexW2951364386MaRDI QIDQ4575846FDOQ4575846
Authors: 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
Recommendations
- About the Structure of the Integer Cone and Its Application to Bin Packing
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Polynomiality for bin packing with a constant number of item types
- Bin packing with fixed number of bins revisited
- Bin packing with fixed number of bins revisited
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (8)
- Title not available (Why is that?)
- Parameterized complexity of machine scheduling: 15 open problems
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
- Approximation and online algorithms for multidimensional bin packing: a survey
- Using structural properties for integer programs
- About the Structure of the Integer Cone and Its Application to Bin Packing
- New algorithmic results for bin packing and scheduling
- Combinatorial \(n\)-fold integer programming and applications
This page was built for publication: About the structure of the integer cone and its application to bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575846)
