When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?

We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume here that the costs are given by an n

• Type: Conference
• Year: 1992
• Where: IPCO
• Authors: Alan M. Frieze, Richard M. Karp, Bruce A. Reed
• Keywords: Assignment Relaxation, Asymmetric Traveling Salesman, IPCO 1992, IPCO 2007, Probabilistic Relationship