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

DOI10.1287/IJOC.1060.0192zbMath1241.90117DBLPjournals/informs/Pisinger07OpenAlexW2008590869WikidataQ58826431 ScholiaQ58826431MaRDI QIDQ2892352

David Pisinger

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1060.0192

zbMATH Keywords

computational complexityheuristicsinteger programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (4)

Dynamic reduction heuristics for the rectangle packing area minimization problem ⋮ A novel non-linear approach to minimal area rectangular packing ⋮ Heuristic approaches for the two- and three-dimensional knapsack packing problem ⋮ The maximum diversity assortment selection problem

This page was built for publication: Denser Packings Obtained in O(n log log n) Time