Approximation Schemes for Packing with Item Fragmentation

We consider two variants of the classical bin packing problem in which items may be fragmented . This can potentially reduce the total number of bins needed for packing the instance. However, since fragmentation incurs overhead, we attempt to avoid it as much as possible. In bin packing with size in...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems 2008-07, Vol.43 (1), p.81-98
Hauptverfasser:	Shachnai, Hadas, Tamir, Tami, Yehezkely, Omer
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Cable TV Computer Science Employment Linear programming Mathematical models Packaging Packing problem Scheduling Studies Theory of Computation Variables
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!