Colored Bin Packing: Online Algorithms and Lower Bounds

Abstract In the Colored Bin Packing problem a sequence of items of sizes up to 1 arrives to be packed into bins of unit capacity. Each item has one of at least two colors and an additional constraint is that we cannot pack two items of the same color next to each other in the same bin. The objective...
Ausführliche Beschreibung

Gespeichert in:
Autor*in:

Böhm, Martin [verfasserIn]

Dósa, György

Epstein, Leah

Sgall, Jiří

Veselý, Pavel

Format:

Artikel

Sprache:

Englisch

Erschienen:

2016

Schlagwörter:

Online algorithms

Bin packing

Worst-case analysis

Colored bin packing

Black and white bin packing

Anmerkung:

© Springer Science+Business Media New York 2016

Übergeordnetes Werk:

Enthalten in: Algorithmica - Springer US, 1986, 80(2016), 1 vom: 17. Nov., Seite 155-184

Übergeordnetes Werk:

volume:80 ; year:2016 ; number:1 ; day:17 ; month:11 ; pages:155-184

Links:

Volltext

DOI / URN:

10.1007/s00453-016-0248-2

Katalog-ID:

OLC2054851744

Nicht das Richtige dabei?

Schreiben Sie uns!