Multidimensional packing problems

Leah Epstein, Rob van Stee

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

There are several ways to generalize the bin packing problem to more dimensions. We consider two- and three-dimensional strip packing, and bin packing in dimensions two and higher. Finally we consider vector packing and several other variations.

Original languageEnglish
Title of host publicationHandbook of Approximation Algorithms and Metaheuristics
PublisherCRC Press
Pages35-1-35-16
ISBN (Electronic)9781420010749
ISBN (Print)1584885505, 9781584885504
DOIs
StatePublished - 1 Jan 2007

Bibliographical note

Publisher Copyright:
© 2007 by Taylor & Francis Group, LLC.

ASJC Scopus subject areas

  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Multidimensional packing problems'. Together they form a unique fingerprint.

Cite this