A beam search algorithm for the circular packing problem
From MaRDI portal
Publication:960400
DOI10.1016/j.cor.2008.02.003zbMath1177.90330MaRDI QIDQ960400
Mhand Hifi, Rym M'Hallah, Hakim Akeb
Publication date: 17 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.02.003
beam search; diversification; dichotomous search; circular packing; local-position distance; maximum hole degree
Related Items
A literature review on circle and sphere packing problems: models and methodologies, Adaptive beam search lookahead algorithms for the circular packing problem, Approximation schemes for covering and packing problems in image processing and VLSI
Cites Work
- Adaptive algorithms for circular cutting/packing problems
- Packing different-sized circles into a rectangular container
- Curved hexagonal packings of equal disks in a circle
- A beam search algorithm for the load sequencing of outbound containers in port container terminals
- Approximate algorithms for constrained circular cutting problems
- Disk packing for the estimation of the size of a wire bundle
- Reformulation descent applied to circle packing problems
- Job shop scheduling with beam search
- An improved algorithm for the packing of unequal circles within a larger containing circle
- A simulated annealing approach for the circular cutting problem
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Repeated patterns of dense packings of equal disks in a square
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Minimizing the object dimensions in circle and sphere packing problems
- Adaptive and restarting techniques-based algorithms for circular packing problems
- New heuristics for packing unequal circles into a circular container
- An improved typology of cutting and packing problems
- A dynamic adaptive local search algorithm for the circular packing problem
- A New Upper Bound for the Cylinder Packing Problem
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Greedy algorithms for packing unequal circles into a rectangular container
