Solution of a Large-Scale Traveling-Salesman Problem
From MaRDI portal
Publication:3565230
DOI10.1007/978-3-540-68279-0_1zbMath1187.90007OpenAlexW2058937865MaRDI QIDQ3565230
Vašek Chvátal, George B. Dantzig, D. R. Fulkerson, Selmer Johnson, William Cook
Publication date: 3 June 2010
Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0_1
Combinatorial optimization (90C27) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)
Related Items (2)
On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain ⋮ Large-scale 0-1 linear programming on distributed workstations
This page was built for publication: Solution of a Large-Scale Traveling-Salesman Problem
