Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference13 articles.
1. N. Christofides, A. Mingozzi and P. Toth, Space state relaxation procedures for the computation of bounds to routing problems, Networks 11(1981)145.
2. A. Croes, A method for solving traveling salesman problems, Oper. Res. 5(1958)791.
3. M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
4. P.C. Kanellakis and C.H. Papadimitriou, Local search for the asymmetric traveling salesman problem, Oper. Res. 28(1980)1086.
5. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.),The Traveling Salesman Problem (Wiley, Chichester, 1985).
Cited by
413 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献