Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints
From MaRDI portal
Publication:4925267
DOI10.1007/978-3-642-38768-5_46zbMath1382.68089OpenAlexW1613183352MaRDI QIDQ4925267
Koji M. Kobayashi, Hiroshi Fujiwara
Publication date: 11 June 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://soar-ir.repo.nii.ac.jp/record/19567/files/Improved_Lower_Bounds_for_the_Online_Bin_Packing_Problem_with_Cardinality_Constraints.pdf
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)
Related Items (1)
This page was built for publication: Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints
