𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bin packing with fixed number of bins revisited

✍ Scribed by Klaus Jansen; Stefan Kratsch; Dániel Marx; Ildikó Schlotter


Book ID
119292553
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
281 KB
Volume
79
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On Bin Packing with Conflicts
✍ Epstein, Leah; Levin, Asaf 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 478 KB
A 1312 approximation algorithm for bin p
✍ Paolo Dell'Olmo; Hans Kellerer; Maria Grazia Speranza; Zsolt Tuza 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 430 KB

A set of items has to be assigned to a set of bins with size one. If necessary, the size of the bins can be extended. The objective is to minimize the total size, i.e., the sum of the sizes of the bins. The Longest Processing Time heuristic is applied to this NP-hard problem. For this approximation