𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient procedure for the N-city traveling salesman problem

✍ Scribed by B.R. Feiring

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
232 KB
Volume
13
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient composite heuristic for the
An efficient composite heuristic for the symmetric generalized traveling salesman problem
✍ Jacques Renaud; Fayez F. Boctor πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 1014 KB

The main purpose of this paper is to introduce a new composite heuristic for solving the generalized traveling salesman problem. The proposed heuristic is composed of three phases: the construction of an initial partial solution, the insertion of a node from each non-visited node-subset, and a solut

Efficient special case algorithms for th
Efficient special case algorithms for the n-line planar traveling salesman problem
✍ 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