Algorithms for the circular two-dimensional open dimension problem

DOI10.1111/J.1475-3995.2008.00655.XzbMATH Open1377.90070OpenAlexW1965176508MaRDI QIDQ4600628FDOQ4600628

Authors: 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

Recommendations

• Solving the circular open dimension problem by using separate beams and look-ahead strategies
• Adaptive algorithms for circular cutting/packing problems
• Approximate algorithms for constrained circular cutting problems
• Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
• A hybrid beam search looking-ahead algorithm for the circular packing problem

zbMATH Keywords

binary searchbeam searchbest local positionopen dimensionstrip cutting/packing

Mathematics Subject Classification ID

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

Cited In (12)

• Discrete‐event simulation is still alive and strong: evidence from bibliometric performance evaluation of research during COVID‐19 global health pandemic
• Optimized packing multidimensional hyperspheres: a unified approach
• A formulation space search heuristic for packing unequal circles in a fixed size circular container
• A literature review on circle and sphere packing problems: models and methodologies
• Solving the circular open dimension problem by using separate beams and look-ahead strategies
• An anchorage planning strategy with safety and utilization considerations
• A hybrid beam search looking-ahead algorithm for the circular packing problem
• Approximate algorithms for constrained circular cutting problems
• Iterated tabu search for the circular open dimension problem
• Solving the two-dimensional CIS problem by a rational algorithm
• Packing non-identical circles within a rectangle with open length
• Packing unequal circles into a strip of minimal length with a jump algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600628)