Author:
Starostin Nikolay V.,Klyuev Ilya V.
Publisher
Springer International Publishing
Reference14 articles.
1. Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)
2. Carpaneto, G., Fischetti, M., Toth, P.: New lower bounds for the symmetric travelling salesman problem. Mathematical Programming 45, 233–254 (1989)
3. Carpaneto, G., Toth, P.: Some new branching and bounding criteria for the asymmetric travelling salesman problem. Management Science 26, 736–743 (1980)
4. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388, Graduate School of Industrial Admin (1976)
5. Norback, J., Love, R.: Heuristic for the Hamiltonian path problem in Euclidean two space. Journal of the Operational Research Society 30, 363–368 (1979)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献