Author:
Bhattacharyya Malay,Bandyopadhyay Anup Kumar
Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman & Co., New York (1979)
2. Bellmore, M., Hong, S.: Transformation of multisalesmen problem to the standard traveling salesman problem. J. Assoc. Comput. Mach. 21(3), 500–504 (1974)
3. Bellmore, M., Nemhauser, G.L.: The traveling salesman problem: a survey. Oper. Res. 16, 538–558 (1968)
4. Held, M., Karp, R.M.: The traveling salesman problem and minimum spanning tree. Part II. Math. Program. 1, 6–25 (1971)
5. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 495–516 (1973)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献