𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heuristic evaluation techniques for bin packing approximation algorithms

✍ Scribed by A. Aiello; E. Burattini; A. Massarotti; F. Ventriglia

Book ID
110579524
Publisher
Springer Milan
Year
1985
Tongue
English
Weight
637 KB
Volume
22
Category
Article
ISSN
0008-0624

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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