✦ LIBER ✦

Reoptimizing the traveling salesman problem

✍ Scribed by Claudia Archetti; Luca Bertazzi; M. Grazia Speranza

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 112 KB
Volume: 42
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10091

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

The Traveling Salesman Problem with Back

The Traveling Salesman Problem with Backhauls

✍ Michel Gendreau; Alain Hertz; Gilbert Laporte 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 590 KB

The traveling salesman problem with cumu

The traveling salesman problem with cumulative costs

✍ Lucio Bianco; Aristide Mingozzi; Salvatore Ricciardelli 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 634 KB