Heuristics for the Traveling Salesman Problem
暂无分享,去创建一个
[1] David S. Johnson,et al. Asymptotic experimental analysis for the Held-Karp traveling salesman bound , 1996, SODA '96.
[2] Forschungsinstitut für Diskrete. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003 .
[3] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.
[4] David S. Johnson,et al. Data structures for traveling salesmen , 1993, SODA '93.
[5] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[6] Corso Elvezia,et al. Ant colonies for the traveling salesman problem , 1997 .
[7] Weixiong Zhang,et al. Depth-First Branch-and-Bound versus Local Search: A Case Study , 2000, AAAI/IAAI.