A survey of some non-standard traveling salesman problems

0.00 Avg rating—0 Votes

Article ID:	iaor1994334
Country:	Serbia
Volume:	2
Start Page Number:	163
End Page Number:	185
Publication Date:	Apr 1992
Journal:	Yugoslav Journal of Operations Research
Authors:	Cvetkovic Dragos, Milosavljevic Milan, Dimitrijevic Vladimir
Keywords:	programming: dynamic, programming: branch and bound

Abstract:

The authors present a survey of some non-standard traveling salesman problems (TSP) with emphasis on authors’ contributions. The results include complexity indices and k-best solutions for the ordinary TSP, the TSP on a chained structure, a multi-TSP on a bandwidth-limited digraph as well as the corresponding general case a generalized TSP as well as the description of some software for TSP.

Reviews

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