𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem

✍ Scribed by D. Karapetyan; G. Gutin


Book ID
113584012
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
594 KB
Volume
219
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Efficient special case algorithms for th
✍ M. Cutler πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 482 KB

## Abstract The traveling salesman problem, path, or cycle is NP‐complete. All known exact solutions to this problem are exponential. In the __N‐line planar__ traveling salesman problem the points are on __N__ lines in the plane. In this paper, simple and efficient low‐degree polynomial solutions a