Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximate algorithms for constrained circular cutting problems
Computers and Operations Research
An effective hybrid algorithm for the problem of packing circles into a larger containing circle
Computers and Operations Research
Reformulation descent applied to circle packing problems
Computers and Operations Research
New heuristics for packing unequal circles into a circular container
Computers and Operations Research
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Computers and Industrial Engineering
Two-dimensional equilibrium constraint layout using simulated annealing
Computers and Industrial Engineering
Efficiently packing circles into a larger containing circle
HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
Packing unequal circles using formulation space search
Computers and Operations Research
Hi-index | 0.01 |
In this paper, we develop a new algorithm that incorporates the improved PERM into an already existing simple deterministic heuristic, the principle of maximum cave degree for corner-occupying actions, to solve the problem of packing equal or unequal circles into a larger circle container. We compare the performance of our algorithm on several problem instances taken from the literature with previous algorithms. The computational results show that the proposed approach produces high-quality solutions within reasonable computational times. Although our algorithm is less efficient than Zhang's for several large-scale equal-size instances, it is noteworthy that for several unequal circle instances we found new lower bounds missed in previous papers.