All-Around Near-Optimal Solutions for the Online Bin Packing Problem

DOI10.1007/978-3-662-48971-0_61zbMath1472.68220arXiv1404.4526OpenAlexW2403438914MaRDI QIDQ3459910

Shahin Kamali, Alejandro López-Ortiz

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.4526

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Models for video-on-demand scheduling with costs

This page was built for publication: All-Around Near-Optimal Solutions for the Online Bin Packing Problem