𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A heuristic algorithm for traveling salesman problems

✍ Scribed by Said Ashour; J.F. Vega; R.G. Parker

Publisher
Elsevier Science
Year
1972
Weight
685 KB
Volume
6
Category
Article
ISSN
0041-1647

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A polynomial algorithm for a constrained
A polynomial algorithm for a constrained traveling salesman problem
✍ J.H. Rubinstein; D.A. Thomas; N.C. Wormald πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 125 KB

## Abstract We give a polynomial‐time algorithm for finding a solution to the Traveling Salesman Problem when the points given are constrained to lie on a fixed set of smooth curves of finite length. Β© 2001 John Wiley & Sons, Inc.