Author:
Chen Mao,Yang Yajing,Zeng Zeyu,Tang Xiangyang,Peng Xicheng,Liu Sannuya
Funder
National Natural Science Foundation of China
Reference34 articles.
1. A beam search algorithm for the circular packing problem;Akeb;Comput. Oper. Res.,2009
2. Adaptive beam search lookahead algorithms for the circular packing problem;Akeb;Int. Trans. Oper. Res.,2010
3. J. Akiyama, R. Mochizuki, N. Mutoh, G. Nakamura. Maximin distance for n points in a unit square or a unit circle. In: J. Akiyama, M. Kano (Eds.). Japanese Conference on Discrete and Computational Geometry, JCDCG 2002, Tokyo, Japan, 2002, December 6–9.
4. Improving dense packings of equal disks in a square;Boll;Electron. J. Comb.,2000
5. Solving circle packing problems by global optimization: Numerical results and industrial applications;Castillo;Eur. J. Oper. Res.,2008