Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
暂无分享,去创建一个
[1] Jeffrey Horn,et al. Handbook of evolutionary computation , 1997 .
[2] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .
[3] Esther M. Arkin,et al. Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..
[4] Joseph S. B. Mitchell,et al. Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.
[5] Khaled M. Elbassioni,et al. Approximation Algorithms for Euclidean Group TSP , 2005, ICALP.
[6] Joachim Gudmundsson,et al. TSP with neighborhoods of varying size , 2005, J. Algorithms.
[7] Marcus Gallagher,et al. On the importance of diversity maintenance in estimation of distribution algorithms , 2005, GECCO '05.
[8] Oded Schwartz,et al. On the complexity of approximating tsp with neighborhoods and related problems , 2003, computational complexity.
[9] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[10] Joachim Gudmundsson,et al. A Fast Approximation Algorithm for TSP with Neighborhoods , 1999, Nord. J. Comput..
[11] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[12] Christos H. Papadimitriou,et al. The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..
[13] Joseph S. B. Mitchell,et al. Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.