✦ LIBER ✦

An on-line algorithm for variable-sized bin packing

✍ Scribed by J. Csirik

Publisher: Springer-Verlag
Year: 1989
Tongue: English
Weight: 462 KB
Volume: 26
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00289157

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new version of on-line variable-sized

A new version of on-line variable-sized bin packing

✍ Guochuan Zhang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 304 KB

This paper investigates a new version of the on-line variable-sized bin packing problem. Suppose that bin capacities can vary. Given a list of items, the goal is to pack items in the bins which arrive in an on-line way such that the total size of bins used is minimized. It is shown that next fit and

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

An O(n) bin-packing algorithm for unifor

An O(n) bin-packing algorithm for uniformly distributed data

✍ J. Csirik; G. Galambos 📂 Article 📅 1986 🏛 Springer Vienna 🌐 English ⚖ 237 KB

Multidimensional on-line bin packing: Al

Multidimensional on-line bin packing: Algorithms and worst-case analysis

✍ Don Coppersmith; Prabhakar Raghavan 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Lower bounds for 1-, 2- and 3-dimensiona

Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms

✍ G. Galambos; A. Vliet 📂 Article 📅 1994 🏛 Springer Vienna 🌐 English ⚖ 664 KB

Shelf algorithms for on-line strip packi

Shelf algorithms for on-line strip packing

✍ János Csirik; Gerhard J. Woeginger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 461 KB

In the strip packing problem, the goal is to pack a set of rectangles into a vertical strip of unit width so as to minimize the total height of the strip needed. For the on-line version of this problem, Baker and Schwarz introduced the class of so-called shelf algorithms. One of these shelf algorith