The random link approximation for the Euclidean traveling salesman problem
暂无分享,去创建一个
O. Bohigas | O. Martin | N. Cerf | J. B. D. Monvel | A. Percus | N. Cerf | Olivier Martin
[1] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[2] Josep Díaz,et al. Proceedings of the 10th Colloquium on Automata, Languages and Programming , 1983 .
[3] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[4] M. Mézard,et al. Spin Glass Theory and Beyond , 1987 .
[5] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.
[6] David S. Johnson,et al. Asymptotic experimental analysis for the Held-Karp traveling salesman bound , 1996, SODA '96.
[7] Mike Mannion,et al. Complex systems , 1997, Proceedings International Conference and Workshop on Engineering of Computer-Based Systems.