✦ LIBER ✦

Bin packing: On optimizing the number of pieces packed

✍ Scribed by Donald K. Friesen; Michael A. Langston

Publisher: Springer Netherlands
Year: 1987
Tongue: English
Weight: 688 KB
Volume: 27
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01934179

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Convergence of optimal stochastic bin pa

Convergence of optimal stochastic bin packing

✍ Wansoo T Rhee 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 165 KB

Next-fit packs a list and its reverse in

Next-fit packs a list and its reverse into the same number of bins

✍ David C Fisher 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 233 KB

On the rate of taxation in a cooperative

On the rate of taxation in a cooperative bin packing game

✍ Gerhard J. Woeginger 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 483 KB

A stochastic analysis of the NFD bin-pac

A stochastic analysis of the NFD bin-packing algorithm

✍ Micha Hofri; Sami Kamhi 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 794 KB

Complexity of core allocation for the bi

Complexity of core allocation for the bin packing game

✍ Zhixin Liu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 853 KB

This paper provides complexity results and develops optimal algorithms for core membership and emptiness tests of the bin packing game. Our algorithms find the maximum surplus profit, the least integer core value, and the minimum value required by the grand coalition for the existence of an integer