Linearity in the Traveling Salesman Problem
暂无分享，去创建一个
Abstract In the multiple-asymmetric TSP, a tour's letter rearrangement neighborhood weight is linear in the tourlengths of the tour and its inverse. This reveals that in the multiple-symmetric TSP, no arbitrarily poor local optima exist in such neighborhoods of derangement tours.
[1] Zvi Drezner,et al. Tabu search model selection in multiple regression analysis , 1999 .
[2] E. Lawler,et al. Well-solved special cases , 1985 .
[3] Lov K. Grover. Local search and the local structure of NP-complete problems , 1992, Oper. Res. Lett..
[4] B. Codenotti,et al. Traveling salesman problem and local search , 1992 .
[5] E. Lawler,et al. Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .