The traveling salesman problem: An update of research
作者:
R. G. Parker,
R. L. Rardin,
期刊:
Naval Research Logistics Quarterly
(WILEY Available online 1983)
卷期:
Volume 30,
issue 1
页码: 69-96
ISSN:0028-1441
年代: 1983
DOI:10.1002/nav.3800300107
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractDuring the course of the last few years, attacks on the traveling salesman problem have resulted in a variety of often innovative and rather powerful computational procedures. In this article, we present a review of these results for problems defined on weighted and unweighted graphs. Some account of computational behavior for exact algorithms is provided; however, the primary coverage deals with the strategy of particular procedures. In addition, we include some aspects of nonexact algorithms with major interest confined to the establishment of worst‐case bound
点击下载:
PDF
(1703KB)
返 回