论文信息 - Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut - 字舞流文

Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut

M. Padberg | G. Rinaldi

[1] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[2] Martina Gorges-Schleuter,et al. ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[3] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .

[4] Roy E. Marsten,et al. The Design of the XMP Linear Programming Library , 1981, TOMS.

[5] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[6] Martin Grötschel,et al. On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .

[7] Manfred W. Padberg,et al. On the symmetric travelling salesman problem: A computational study , 1980 .

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

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

[10] Selmer M. Johnson,et al. On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem , 1959 .

[11] William J. Cook,et al. Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[12] J. P. Secrétan,et al. Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .