๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Approximation Scheme for Bin Packing with Conflicts

โœ Scribed by Klaus Jansen

Book ID
110282233
Publisher
Springer US
Year
1999
Tongue
English
Weight
89 KB
Volume
3
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Bin Packing with Conflicts
On Bin Packing with Conflicts
โœ Epstein, Leah; Levin, Asaf ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 478 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