Log in to save to my catalogue

Approximate Traveling Salesman Algorithms

Approximate Traveling Salesman Algorithms

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_1303066152

Approximate Traveling Salesman Algorithms

About this item

Full title

Approximate Traveling Salesman Algorithms

Publisher

Baltimore, Md: INFORMS

Journal title

Operations research, 1980-05, Vol.28 (3-Part-II), p.694-711

Language

English

Formats

Publication information

Publisher

Baltimore, Md: INFORMS

More information

Scope and Contents

Contents

There have been a multitude of heuristic algorithms proposed for the solution of large scale traveling salesman problems. Our intent in this paper is to examine some of these well known heuristics, to introduce some new heuristics, and to compare these approximate techniques on the basis of efficiency and accuracy. We emphasize the strengths and we...

Alternative Titles

Full title

Approximate Traveling Salesman Algorithms

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_proquest_journals_1303066152

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_1303066152

Other Identifiers

ISSN

0030-364X

E-ISSN

1526-5463

DOI

10.1287/opre.28.3.694

How to access this item