✦ LIBER ✦

Pyramidal tours and the traveling salesman problem

✍ Scribed by Jack A.A. van der Veen; Gerard Sierksma; René van Dal

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 728 KB
Volume: 52
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(91)90339-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On prize-collecting tours and the asymme

On prize-collecting tours and the asymmetric travelling salesman problem

✍ Mauro Dell'Amico; Francesco Maffioli; Peter Värbrand 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 722 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