Author:
Eremeev Anton V.,Kovalenko Julia V.
Publisher
Springer International Publishing
Reference27 articles.
1. Buriol, L.S., Franca, P.M., Moscato, P.: A new memetic algorithm for the asymmetric traveling salesman problem. J. Heuristics 10, 483–506 (2004)
2. Chvatal, V.: Probabilistic methods in graph theory. Ann. Oper. Res. 1, 171–182 (1984)
3. Lecture Notes in Computer Science;J Cirasella,2001
4. Cook, W., Seymour, P.: Tour merging via branch-decomposition. INFORMS J. Comput. 15(2), 233–248 (2003)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献