Technical Note—An Algorithm to Find Elementary Negative-Cost Circuits with a Given Number of Arcs—The Traveling-Salesman Problem

J. P. Netter
Additional contact information
J. P. Netter: The Johns Hopkins University Baltimore, Maryland

Operations Research, 1971, vol. 19, issue 1, 234-237

Abstract: A theorem on sequences of numbers reduces the amount of tree searching to locate an elementary negative-cost circuit in a network; the search may be restricted to circuits with a given number of arcs. This result leads to a primal algorithm for the traveling-salesman problem.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.1.234 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:1:p:234-237

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().