Denser Packings Obtained in O(n log log n) Time

The placement problem is that of packing a set of rectangles into a minimum-area enclosing rectangle. Since it is difficult to optimize directly on a placement, a number of topological representations have been presented in the literature. One of the most successful is the sequence pair representati...

Full description

Saved in:

Bibliographic Details
Published in:	INFORMS journal on computing Vol. 19; no. 3; pp. 395 - 405
Main Author:	Pisinger, David
Format:	Journal Article
Language:	English
Published:	Linthicum INFORMS 22.06.2007 Institute for Operations Research and the Management Sciences
Subjects:	Algorithms Analysis analysis of algorithms Complexity theory Computational complexity cutting stock Evaluation heuristic Heuristic programming integer Integer programming Packing problem Production scheduling programming Studies United States
ISSN:	1091-9856, 1526-5528, 1091-9856
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!