Solving the circular open dimension problem by using separate beams and look-ahead strategies

DOI10.1016/J.COR.2012.11.025zbMATH Open1352.90078OpenAlexW2047195216MaRDI QIDQ502428FDOQ502428

Authors: Hakim Akeb, Mhand Hifi 

Publication date: 5 January 2017

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.11.025

Recommendations

• Algorithms for the circular two-dimensional open dimension problem
• Iterated tabu search for the circular open dimension problem
• A beam search algorithm for the circular packing problem
• Adaptive beam search lookahead algorithms for the circular packing problem
• Beam search and non-linear programming tools for the circular packing problem
• A hybrid beam search looking-ahead algorithm for the circular packing problem
• Computing optimal beams in two and three dimensions
• Revisiting variable radius circles in constructive geometric constraint solving
• The Traveling Beams Optical Solutions for Bounded NP-Complete Problems

zbMATH Keywords

cutting and packingstrip packingbeam searchlook-aheadminimum local-distance positionmulti-start strategy

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cited In (8)

• Integer programming formulations for approximate packing circles in a rectangular container
• An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
• A formulation space search heuristic for packing unequal circles in a fixed size circular container
• Approximate packing: integer programming models, valid inequalities and nesting
• A hybrid beam search looking-ahead algorithm for the circular packing problem
• Packing circular-like objects in a rectangular container
• Iterated tabu search for the circular open dimension problem
• Algorithms for the circular two-dimensional open dimension problem

This page was built for publication: Solving the circular open dimension problem by using separate beams and look-ahead strategies

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