Abstract
The classic traveling salesman problem is characterized in terms of continuous flows on a specially constructed non-conservative network, in 2n − 1 linear constraints and a cardinality constraint. It is shown that every solution to the network problem is a hamiltonian circuit.
This is a preview of subscription content, log in via an institution to check access.
References
M. Bellmore and G.L. Nemhauser, “The traveling salesman problem: a survey”,Operations Research 16 (1968) 538–558.
M. Bellmore and J.C. Malone, “Pathology of traveling-salesman subtour elimination algorithms”,Operations Research 19 (1971) 278–307.
R.S. Garfinkel and G.L. Nemhauser,Integer programming (John Wiley, New York, 1972).
M. Held and R.M. Karp, “The traveling-salesman problem and minimum spanning trees: part II”,Mathematical Programming 1 (1971) 6–25.
J.D.C. Little, K.G. Murty, D.W. Sweeney and C. Karel, “An algorithm for the traveling salesman problem”,Operation Research 11 (1963) 979–989.
R.S. Rubin “Vertex generation and cardinality constrained linear programs”,Operations Research 23 (1975) 555–565.
J.A. Svestka and V.E. Huckfeldt, “Computational experience with anm-salesman traveling salesman algorithm”,Management Science 19 (1973) 790–799.
T. Tanahashi and D.G. Luenburger, “Cardinality constrained linear programming”, Stanford University (1971).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Svestka, J.A. A continuous variable representation of the traveling salesman problem. Mathematical Programming 15, 211–213 (1978). https://doi.org/10.1007/BF01609019
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01609019