Technical Note—An Algorithm to Find Elementary Negative-Cost Circuits with a Given Number of Arcs—The Traveling-Salesman Problem
Published Online:1 Feb 1971https://doi.org/10.1287/opre.19.1.234
Volume 19, Issue 1
January-February 1971
Pages 1-256
Article Information
Metrics
Information
- Published Online:February 01, 1971
© 1971 INFORMS
Cite as
J. P. Netter, (1971) Technical Note—An Algorithm to Find Elementary Negative-Cost Circuits with a Given Number of Arcs—The Traveling-Salesman Problem. Operations Research 19(1):234-237.
https://doi.org/10.1287/opre.19.1.234
