About this document
Algorithms for Packing Problems Analysis by Mnaom is a document available to read on EtoBox.
This document is the dissertation of Nils Schweer submitted to obtain a Doctor of Natural Sciences degree. It studies three packing problems, presenting algorithms that compute optimal or provably good solutions. The three problems are: 1) Maintaining arrays of contiguous objects, where blocks are inserted and later removed from an array, with the goal of minimizing completion time and move costs. 2) Online square packing, where squares must be packed on top of other squares or on the bottom of a strip, wit
- Author
- Mnaom
- Language
- EN