𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for the oriented two-dimensional bin packing problem

✍ Scribed by Andrea Lodi; Silvano Martello; Daniele Vigo

Book ID
108445371
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
135 KB
Volume
112
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

A new lower bound for the non-oriented t
A new lower bound for the non-oriented two-dimensional bin-packing problem
✍ FranΓ§ois Clautiaux; Antoine Jouglet; Joseph El Hayek πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 183 KB

We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous results. Computational experiments show that the bounds are tight. We also discuss the case where the bin is not a square.