A polynomial algorithm for a constrained traveling salesman problem

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.

Saved in:
Bibliographic Details
Published in:Networks 2001-09, Vol.38 (2), p.68-75
Main Authors: Rubinstein, J.H., Thomas, D.A., Wormald, N.C.
Format: Article
Language:English
Subjects:
Applied sciences
Euclidean traveling salesman problem
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
polynomial algorithm
traveling salesman problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0028-3045
1097-0037
DOI:10.1002/net.1025