Johnson D S,McGeoch L A.The traveling salesman problem:a case study in local optimization[A].In:Aarts E H,Lenstra J K,eds.Local Search in Combinatorial Optimization[M],New York:John Wiley and Sons,1996.
[2]
Christofides N.Worst-Case analysis of a new heuristic for the traveling salesman problem.Technical Report[R],No.388,Pittsburgh,PA:Graduate School of Industrial Administration,Carnegie Mellon University,1976.
[3]
Held M,Karp R M.The traveling salesman problem and minimum spanning trees:Part Ⅱ[J].Mathematical Programming,1971:16 ～25.
[4]
WANG Jin-biao.Evolution logic and algorithm for narrow TSP geometric solution[J].Computer Engineering,2005,31(14):75 ～77.[王锦彪.狭义TSP几何解的演化逻辑与算法[J].计算机工程,2005,31(14):75～77.]
[5]
Clarke G,Wright J W.Scheduling of vehicles from a central depot to a number of delivery points[J].Operations Research,1964,12(4):568 ～581.Jul.-Aug.,1964,
[6]
Held M,Karp R M.The traveling-salesman problem and minimum spanning trees[J].Operations Research,1970,18 (6):1138 ～1162.Nov.-Dec.,1970.
[7]
Johnson D S,McGeogh L A,Rothberg E E.Asymptotic experimental analysis for the Held-Karp traveling salesman bound[A].In:Proceedings of the seventh Annual ACM--SIAM Symposium on Discrete Algorithms[C],1996:341 ～ 350.Atlanda Georgia,United States.
