✦ LIBER ✦

The landscape of the traveling salesman problem

✍ Scribed by Peter F. Stadler; Wolfgang Schnabl

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 539 KB
Volume: 161
Category: Article
ISSN: 0375-9601
DOI: 10.1016/0375-9601(92)90557-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The traveling-salesman problem

✍ D. A. Suprunenko 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 254 KB

Transformation of the generalized travel

Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem

✍ Yao-Nan Lien; Eva Ma; Benjamin W.-S. Wah 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 843 KB

Reoptimizing the traveling salesman prob

Reoptimizing the traveling salesman problem

✍ Claudia Archetti; Luca Bertazzi; M. Grazia Speranza 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

The clustered traveling salesman problem

✍ James A. Chisman 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 391 KB

The prize collecting traveling salesman

The prize collecting traveling salesman problem

✍ Egon Balas 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 703 KB

The n-line traveling salesman problem

✍ Günter Rote 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 780 KB

The special case of the Euclidean traveling salesman problem, where the n given points lie on a small number (N) of parallel lines in the plane, is solved by a dynamic programming approach in time nN, for fixed N, i.e., in polynomial time. This extends a result of Cutler (1980) for three lines. Such