A polynomial algorithm for a constrained traveling salesman problem

A polynomial algorithm for a constrained traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor2003398
Country: United States
Volume: 38
Issue: 2
Start Page Number: 68
End Page Number: 75
Publication Date: Sep 2001
Journal: Networks
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.