✦ LIBER ✦

Probabilistic analysis for simple one-and two-dimensional bin packing algorithms

✍ Scribed by Greg N. Frederickson

Book ID: 113162205
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 805 KB
Volume: 11
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(80)90041-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Approximation algorithms for the oriente

Approximation algorithms for the oriented two-dimensional bin packing problem

✍ Andrea Lodi; Silvano Martello; Daniele Vigo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Two heuristics for the one-dimensional b

Two heuristics for the one-dimensional bin-packing problem

✍ Alok Singh; Ashok K. Gupta 📂 Article 📅 2006 🏛 Springer 🌐 German ⚖ 349 KB

A 3-approximation algorithm for two-dime

A 3-approximation algorithm for two-dimensional bin packing

✍ Guochuan Zhang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 189 KB

In the classical two-dimensional bin packing problem one is asked to pack a set of rectangular items, without overlap and without any rotation, into the minimum number of identical square bins. We give an approximation algorithm with absolute worst-case ratio of 3.

Probabilistic analysis of the next fit d

Probabilistic analysis of the next fit decreasing algorithm for bin-packing

✍ WanSoo T. Rhee 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A simple randomized algorithm for two-di

A simple randomized algorithm for two-dimensional strip packing

✍ Yang, Shuangyuan; Han, Shuihua; Ye, Weiguo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 229 KB