Adaptive algorithms for circular cutting/packing problems

DOI10.1504/IJOR.2009.027152zbMath1175.90321OpenAlexW2061706952MaRDI QIDQ1040631

Hakim Akeb, Mhand Hifi

Publication date: 25 November 2009

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2009.027152

zbMATH Keywords

beam searchpackingBLPapproximate algorithmsbest local positioncircular cuttinghill climbing strategiesminimum local distance

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

A beam search algorithm for the circular packing problem ⋮ A hybrid beam search looking-ahead algorithm for the circular packing problem

This page was built for publication: Adaptive algorithms for circular cutting/packing problems