Solving the Illumination Problem with Heuristics
暂无分享,去创建一个
Enrique Alba | Manuel Abellanas | Santiago Canales | Gregorio Hernández-Peñalver | E. Alba | S. Canales | M. Abellanas | Gregorio Hernández-Peñalver
[1] Thomas Bäck,et al. Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .
[2] Thomas Bäck,et al. Evolutionary Algorithms in Theory and Practice , 1996 .
[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[4] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[5] Jorge Urrutia,et al. Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.
[6] Stephan Johannes Eidenbenz. (In-)Approximability of visibility problems on polygons and terrains , 2000 .
[7] H. Szu. Fast simulated annealing , 1987 .
[8] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.
[9] L. Ingber. Very fast simulated re-annealing , 1989 .
[10] Martin Held,et al. Heuristics for the Generation of Random Polygons , 1996, CCCG.