𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The clustered traveling salesman problem

✍ Scribed by James A. Chisman

Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
391 KB
Volume
2
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 n-line traveling salesman problem
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