论文信息 - Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation - 字舞流文

Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation

R. Bland | D. Shallcross

[1] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[2] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[3] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[4] G. L. Nemhauser,et al. Tight bounds for christofides' traveling salesman heuristic , 1978, Math. Program..

[5] P. Luger. Modern X-ray analysis on single crystals , 1980 .

[6] E. Lawler,et al. Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .

[7] M. Padberg,et al. Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[8] Giovanni Rinaldi,et al. Facet identification for the symmetric traveling salesman polytope , 1990, Math. Program..