PERM for solving circle packing problem
From MaRDI portal
Publication:2459405
DOI10.1016/j.cor.2006.10.012zbMath1211.90198OpenAlexW2089766570MaRDI QIDQ2459405
Publication date: 6 November 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.10.012
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Adaptive simulated annealing with greedy search for the circle bin 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 ⋮ An action-space-based global optimization algorithm for packing circles into a square container ⋮ 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 ⋮ Quasi-physical global optimization method for solving the equal circle packing problem ⋮ A new heuristic algorithm for the circular packing problem with equilibrium constraints ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Approximation schemes for covering and packing problems in image processing and VLSI ⋮ A new quasi-human algorithm for solving the packing problem of unit equilateral triangles ⋮ Global optimization method for finding dense packings of equal circles in a circle ⋮ A hybrid beam search looking-ahead algorithm for the circular packing problem ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container
Cites Work
- Unnamed Item
- A short note on a simple search heuristic for the diskspacking problem
- Packing different-sized circles into a rectangular container
- Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
- Integrated container loading software for pulp and paper industry
- Approximate algorithms for constrained circular cutting problems
- Reformulation descent applied to circle packing problems
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- New heuristics for packing unequal circles into a circular container
- Approximation schemes for covering and packing problems in image processing and VLSI
- A heuristic quasi-physical strategy for solving disks packing problem
