✦ LIBER ✦

Online algorithms for a dual version of bin packing

✍ Scribed by J. Csirik; V. Totik

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 386 KB
Volume: 21
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90052-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparing online algorithms for bin pack

Comparing online algorithms for bin packing problems

✍ Leah Epstein; Lene M. Favrholdt; Jens S. Kohrt 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 415 KB

A class of simple stochastic online bin

A class of simple stochastic online bin packing algorithms

✍ U. Hoffmann 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 428 KB

Probabilistic analysis of algorithms for

Probabilistic analysis of algorithms for dual bin packing problems

✍ J Csirik; J.B.G Frenk; G Galambos; A.H.G Rinnooy Kan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 629 KB

“A posteriori” evaluation of bin packing

“A posteriori” evaluation of bin packing approximation algorithms

✍ A. Aiello; E. Burattini; A. Massarotti; F. Ventriglia 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Worst-Case analysis of the FFH algorithm

Worst-Case analysis of the FFH algorithm for online variable-sized bin packing

✍ G. Zhang 📂 Article 📅 1996 🏛 Springer Vienna 🌐 English ⚖ 349 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