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

DOI10.1016/J.COR.2012.11.025zbMath1352.90078OpenAlexW2047195216MaRDI QIDQ502428

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

zbMATH Keywords

beam searchstrip packingcutting and packinglook-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)

Related Items (5)

A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ Integer programming formulations for approximate packing circles in a rectangular container ⋮ Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting ⋮ Packing circular-like objects in a rectangular container ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem

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