An algorithm for M asymmetric travelling salesman problem on a bandwidth-limited graph

0.00 Avg rating—0 Votes

Article ID:	iaor19932426
Country:	Serbia
Volume:	1
Start Page Number:	15
End Page Number:	25
Publication Date:	Mar 1991
Journal:	Yugoslav Journal of Operations Research
Authors:	Cvetkovic Dragos, Milosavljevic Milan, Dimitrijevic Vladimir
Keywords:	programming: dynamic, graphs

Abstract:

This paper presents a polynomial dynamic programming based algorithm for solivng M (M≥1) travelling salesman problem (TSP) on a directed bandwidth-limited graph, where the number of cities to be visited by each of the M travelling salesmen is specified.

Reviews

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