𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast asymptotic approximation scheme for bin packing with rejection

✍ Scribed by Wolfgang Bein; José R. Correa; Xin Han

Book ID
108281378
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
233 KB
Volume
393
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 1312 approximation algorithm for bin p
A 1312 approximation algorithm for bin packing with extendable bins
✍ 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