A beam search algorithm for the circular packing problem
From MaRDI portal
Publication:960400
DOI10.1016/J.COR.2008.02.003zbMATH Open1177.90330OpenAlexW2066587387MaRDI QIDQ960400FDOQ960400
Hakim Akeb, Rym M'Hallah, Mhand Hifi
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
Recommendations
- 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
- A dynamic adaptive local search algorithm for the circular packing problem
- Adaptive algorithms for circular cutting/packing problems
diversificationbeam searchdichotomous searchcircular packinglocal-position distancemaximum hole degree
Cites Work
- An improved typology of cutting and packing problems
- Disk packing for the estimation of the size of a wire bundle
- A beam search algorithm for the load sequencing of outbound containers in port container terminals
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Approximate algorithms for constrained circular cutting problems
- Job shop scheduling with beam search
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Minimizing the object dimensions in circle and sphere packing problems
- Greedy algorithms for packing unequal circles into a rectangular container
- Packing different-sized circles into a rectangular container
- Reformulation descent applied to circle packing problems
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Adaptive and restarting techniques-based algorithms for circular packing problems
- New heuristics for packing unequal circles into a circular container
- A dynamic adaptive local search algorithm for the circular packing problem
- Curved hexagonal packings of equal disks in a circle
- A simulated annealing approach for the circular cutting problem
- Repeated patterns of dense packings of equal disks in a square
- 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
- Adaptive algorithms for circular cutting/packing problems
Cited In (15)
- Approximation schemes for covering and packing problems in image processing and VLSI
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container
- Adaptive beam search lookahead algorithms for the circular packing problem
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Solving a large cutting problem in the glass manufacturing industry
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- A memetic algorithm to pack unequal circles into a square
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a 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
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- Beam search and non-linear programming tools for the circular packing problem
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
This page was built for publication: A beam search algorithm for the circular packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960400)
