Algorithms for the circular two‐dimensional open dimension problem

DOI10.1111/j.1475-3995.2008.00655.xzbMath1377.90070OpenAlexW1965176508MaRDI QIDQ4600628

Hakim Akeb, Mhand Hifi

Publication date: 12 January 2018

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

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2008.00655.x

zbMATH Keywords

beam searchbinary searchbest local positionopen dimensionstrip cutting/packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (8)

A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ An anchorage planning strategy with safety and utilization considerations ⋮ Packing non-identical circles within a rectangle with open length ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Discrete‐event simulation is still alive and strong: evidence from bibliometric performance evaluation of research during COVID‐19 global health pandemic ⋮ Packing unequal circles into a strip of minimal length with a jump algorithm ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ A hybrid beam search looking-ahead algorithm for the circular packing problem

This page was built for publication: Algorithms for the circular two‐dimensional open dimension problem