✦ 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
DOI: 10.1016/j.jcss.2012.04.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bin Packing with Rejection Revisited

✍ Leah Epstein 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 532 KB

Bin packing: Maximizing the number of pi

Bin packing: Maximizing the number of pieces packed

✍ E. G. Coffman; J. Y. -T. Leung; D. W. Ting 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 450 KB

Bin-packing problem with concave costs o

Bin-packing problem with concave costs of bin utilization

✍ Chung-Lun Li; Zhi-Long Chen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

Bin packing: On optimizing the number of

Bin packing: On optimizing the number of pieces packed

✍ Donald K. Friesen; Michael A. Langston 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 688 KB

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

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