Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-26T00:54:24.819Z Has data issue: false hasContentIssue false
  • English
  • Français

Edgeconvex Circuits and the Traveling Salesman Problem

Published online by Cambridge University Press:  20 November 2018

Kenneth Kalmanson
Kenneth Kalmanson*
Affiliation:
Montclair State College, Upper Montclair, New Jersey
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This paper will continue certain investigations into the geometric nature of the well-known traveling salesman problem: that of determining the extreme Hamiltonian circuits (H-circuits) of a graph.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 27 , Issue 5 , 01 October 1975 , pp. 1000 - 1010
Copyright
Copyright © Canadian Mathematical Society 1975

References

1. Kalmanson, K., Classes of combinatorial extrema, Annals of the New York Academy of Sciences, vol. 175, article 1, pp. 243–252.Google Scholar
2. Kalmanson, K., Classes of combinatorial extrema in certain metric spaces, Ph.D. dissertation, CUNY, 1970.Google Scholar
3. Kalmanson, K., An analysis of extreme Hamiltonian circuits, Technical report prepared for the Office of Naval Research under contract, N00014–72-C-0436, 1972.Google Scholar
4. Quintas, L. and Supnick, F., Extreme H-circnits; resolution of the convex-even case, Proc. Am. Math. Soc. 16 (1965), 1058–1061.Google Scholar
5. Quintas, L. and Supnick, F., Extrema in space-time, Can. J. Math. 18 (1966), 678-691. 6. On some properties of shortest Hamiltonian circuits, Amer. Math. Monthly 72 (1965), 977–980.Google Scholar
7. Quintas, L. and Supnick, F., Extreme H-circuits; resolution of the convex-odd case, Proc. Am. Math. Soc. 16 (1964), 454–456.Google Scholar
8. Supnick, F., Extreme Hamiltonian lines, Ann. of Math. 66 (1957), 179–201.Google Scholar
9. Supnick, F., A class of combinatorial extrema, Annals of the New York Academy of Sciences, vol. 175, article 1, 370–382.Google Scholar