Mathematical Programming

, Volume 15, Issue 1, pp 228–231

The Held—Karp algorithm and degree-constrained minimum 1-trees

Authors

  • Y. Yamamoto
    • Keio University
Short Communication

DOI: 10.1007/BF01609023

Cite this article as:
Yamamoto, Y. Mathematical Programming (1978) 15: 228. doi:10.1007/BF01609023

Abstract

In this note we propose to find a degree-constrained minimum 1-tree in the Held—Karp algorithm [5, 6] for the symmetric traveling-salesman problem, and show that it is reduced to finding a minimum common basis of two matroids.

Key words

Traveling-Salesman Problem1-treeMatroid

Copyright information

© The Mathematical Programming Society 1978