One-Sided Monge TSP Is NP-Hard (original) (raw)

Lecture Notes in Computer Science, 2006

Abstract

The Travelling Salesman Problem (TSP) is a classical NP- hard optimisation problem. There exist, however, special cases of the TSP that can be solved in polynomial time. Many of the well-known TSP special cases have been characterized by imposing special four-point conditions on the underlying distance matrix. Probably the most famous of these special cases is the TSP on a

Vladimir Deineko hasn't uploaded this paper.

Let Vladimir know you want this paper to be uploaded.

Ask for this paper to be uploaded.