A short note on a simple search heuristic for the diskspacking problem
From MaRDI portal
Publication:702715
DOI10.1023/B:ANOR.0000039514.14699.03zbMath1067.90142OpenAlexW2127249565MaRDI QIDQ702715
Publication date: 17 January 2005
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000039514.14699.03
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
A new heuristic algorithm for the circular packing problem with equilibrium constraints ⋮ Evolutionary computation solutions to the circle packing problem ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Approximation schemes for covering and packing problems in image processing and VLSI ⋮ PERM for solving circle packing problem
This page was built for publication: A short note on a simple search heuristic for the diskspacking problem
