Some generalizations of the traveling salesman prob~em are suggested, leading to problems in which we seek to minimize the summed weight of two or more line-disjoint hamiltonian cycles. A number of seemingly open questions extending the concept of ha-miltonian graphs are raised. Finally, pursuing the Held-Karp approach for solving symmetric traveling salesman problems, an extension of the minimum spanning tree problem is briefly discussed.
CITATION STYLE
Krarup, J. (1995). The Peripatetic Salesman and Some Related Unsolved Problems. In Combinatorial Programming: Methods and Applications (pp. 173–178). Springer Netherlands. https://doi.org/10.1007/978-94-011-7557-9_8
Mendeley helps you to discover research relevant for your work.