Download - The traveling salesman problem on the WWW
![Page 1: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/1.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 1
![Page 2: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/2.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 2
![Page 3: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/3.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 3
…
![Page 4: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/4.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 4
![Page 5: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/5.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 5
![Page 6: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/6.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 6
The traveling salesman problem on the WWW• http://www.math.princeton.edu/tsp/index.html• http://www.cs.rutgers.edu/~chvatal/tsp.html
49 cities• Dantzig, Fulkerson, and Johnson (1954) • Groetschel (1977).
120 cities
• Groetschel and Holland (1987)
tour of 666 interesting places. Proctor and Gamble ran a contest in 1962. The contest required solving a TSP on a specified 33 cities. There was a tie between many people who found the optimum.
• Padberg and Rinaldi (1987) tour through a layout of 2,392 that was obtained from Tektronics Incorporated.
• Padberg and Rinaldi (1987)
532 AT&T switch locations.
• Applegate, Bixby, Chvátal, and Cook (1994) tour for a 7,397-city TSP that arose in a programmable logic array application at AT&T Bell Laboratories.
![Page 7: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/7.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 7
• Applegate, Bixby, Chvátal, and Cook (1998) found the optimal tour of the 13,509 cities in the USA with populations greater than 500.
• Applegate, Bixby, Chvátal, and Cook (2001) found the optimal tour of 15,112 cities in Germany
![Page 8: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/8.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 8
![Page 9: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/9.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 9
![Page 10: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/10.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 10
![Page 11: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/11.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 11
![Page 12: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/12.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 12
![Page 13: The traveling salesman problem on the WWW](https://reader035.vdocuments.us/reader035/viewer/2022070401/56813676550346895d9e044e/html5/thumbnails/13.jpg)
Finite Mathematics, Feodor F. Dragan, Kent State University 13