论文信息 - Reformulation descent applied to circle packing problems - 字舞流文

Reformulation descent applied to circle packing problems

Nenad Mladenovic | Frank Plastria | Dragan Urosevic | F. Plastria | N. Mladenović | D. Urošević

[1] S. Kravitz. Packing Cylinders into Cylindrical Containers , 1967 .

[2] U. Pirl. Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten , 1969 .

[3] Michael A. Saunders,et al. Large-scale linearly constrained optimization , 1978, Math. Program..

[4] Philip E. Gill,et al. Practical optimization , 1981 .

[5] E. Baum. Towards practical `neural' computation for combinatorial optimization problems , 1987 .

[6] M. Gardner. Fractal Music, Hypercards and More...: Mathematical Recreations from Scientific American Magazine , 1991 .

[7] Roman A. Polyak,et al. Modified barrier functions (theory and methods) , 1992, Math. Program..

[8] Andrew B. Kahng,et al. A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[9] Martin Gardner,et al. Fractal music, hypercards and more , 1995, The Mathematical Gazette.

[10] Zvi Drezner,et al. Solving the Continuous p-Dispersion Problem Using Non-linear Programming , 1995 .

[11] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.

[12] P. Hansen,et al. Variable neighborhood search for the p-median , 1997 .

[13] Patric R. J. Östergård,et al. Dense packings of congruent circles in a circle , 1998, Discret. Math..

[14] F. Glover,et al. Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.