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

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.