An effective hybrid algorithm for the problem of packing circles into a larger containing circle
暂无分享,去创建一个
[1] Krzysztof Fleszar,et al. New heuristics for one-dimensional bin-packing , 2002, Comput. Oper. Res..
[2] Wenqi Huang,et al. A heuristic quasi-physical strategy for solving disks packing problem , 2002, Simul. Model. Pract. Theory.
[3] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[4] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[5] Wenqi Huang,et al. Two personification strategies for solving circles packing problem , 1999 .
[6] David Pisinger,et al. Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..
[7] Zhang De. Personification Annealing Algorithm for Solving SAT Problem , 2002 .
[8] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[9] K. Dowsland. Optimising the palletisation of cylinders in cases , 1991 .
[10] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[11] Huaiqing Wang,et al. An improved algorithm for the packing of unequal circles within a larger containing circle , 2002, Eur. J. Oper. Res..
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] Ronald L. Graham,et al. Curved Hexagonal Packings of Equal Disks in a Circle , 1997, Discret. Comput. Geom..
[14] Andrea Lodi,et al. Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..
[15] J. A. George,et al. Packing different-sized circles into a rectangular container , 1995 .
[16] Hamish J. Fraser,et al. Integrated container loading software for pulp and paper industry , 1994 .
[17] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.