Article thumbnail
Location of Repository

On the traveling salesman problem with a relaxed Monge matrix



We show that the traveling salesman problem with a symmetric relaxed Monge matrix as distance matrix is pyramidally solvable and can thus be solved by dynamic programming. Furthermore, we present a polynomial time algorithm that decides whether there exists a renumbering of the cities such that the resulting distance matrix becomes a relaxed Monge matrix. (C) 1998 Elsevier Science B.V. All rights reserved

Topics: QA76
OAI identifier:
Sorry, our data provider has not provided any external links therefore we are unable to provide a link to the full text.

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.