An efficient algorithm for solving the Arbitrary Sized Circle Packing Problem - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Wenqi Huang, Zhanghua Fu, Ruchu Xu. An efficient algorithm for solving the Arbitrary Sized Circle Packing Problem. In International Conference on Electronic and Mechanical Engineering and Information Technology, EMEIT 2011, Harbin, Heilongjiang, China, 12-14 August, 2011. pages 4122-4125, IEEE, 2011. [doi]

The following publications are possibly variants of this publication:

A Cogitative Algorithm for Solving the Equal Circles Packing ProblemWenqi Huang, Yu-Liang Wu, C. K. Wong. In Ding-Zhu Du, Panos M. Pardalos, editors, Handbook of Combinatorial Optimization. pages 591-605, Springer, 1999. [doi]

PERM for solving circle packing problemZhipeng Lü, Wenqi Huang. cor, 35(5):1742-1755, 2008. [doi]

Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular containerWenqi Huang, Zhanghua Fu, Ruchu Xu. chinaf, 56(9):1-14, 2013. [doi]

An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problemDuanbing Chen, Jingfa Liu, Yan Fu, Mingsheng Shang. cor, 37(6):1068-1074, 2010. [doi]

A Simulated Annealing Algorithm for the Circles Packing ProblemDefu Zhang, Wenqi Huang. iccS 2004: 206-214 [doi]

runs on WebDSL