A dynamic adaptive local search algorithm for the circular packing problem
From MaRDI portal
Recommendations
- Adaptive and restarting techniques-based algorithms for circular packing problems
- 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
- Adaptive algorithms for circular cutting/packing problems
Cites work
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- A simulated annealing approach for the circular cutting problem
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- An improved algorithm for the packing of unequal circles within a larger containing circle
- An improved typology of cutting and packing problems
- Approximate algorithms for constrained circular cutting problems
- Curved hexagonal packings of equal disks in a circle
- Cutting and packing. Special issue
- Dense packings of congruent circles in a circle
- scientific article; zbMATH DE number 1175962 (Why is no real title available?)
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Optimising the palletisation of cylinders in cases
- Packing different-sized circles into a rectangular container
- Reformulation descent applied to circle packing problems
- Repeated patterns of dense packings of equal disks in a square
- Two-dimensional packing problems: a survey
Cited in
(21)- Adaptive algorithms for circular cutting/packing problems
- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- A memetic algorithm to pack unequal circles into a square
- Adaptive large neighborhood search for solving the circle bin packing problem
- Near optimal minimal convex hulls of disks
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- Iterated tabu search for the circular open dimension problem
- Evolutionary computation solutions to the circle packing problem
- Adaptive and restarting techniques-based algorithms for circular packing problems
- Recursive circle packing problems
- Adaptive beam search lookahead algorithms for the circular packing problem
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- Approximation schemes for covering and packing problems in image processing and VLSI
- A literature review on circle and sphere packing problems: models and methodologies
- Solution-hashing search based on layout-graph transformation for unequal circle packing
- A heuristic algorithm with multi-scale perturbations for point arrangement and equal circle packing in a convex container
- VOROPACK-D: real-time disk packing algorithm using Voronoi diagram
- A beam search algorithm for the circular packing problem
This page was built for publication: A dynamic adaptive local 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 Q2643959)
