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 language | English |
|---|---|
| Title of host publication | Handbook of Approximation Algorithms and Metaheuristics |
| Publisher | CRC Press |
| Pages | 35-1-35-16 |
| ISBN (Electronic) | 9781420010749 |
| ISBN (Print) | 1584885505, 9781584885504 |
| DOIs | |
| State | Published - 1 Jan 2007 |
Bibliographical note
Publisher Copyright:© 2007 by Taylor & Francis Group, LLC.
ASJC Scopus subject areas
- General Computer Science
Fingerprint
Dive into the research topics of 'Multidimensional packing problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver