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

Alan M. Frieze, Richard M. Karp, Bruce A. Reed. When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?. In Egon Balas, Gérard Cornuéjols, Ravi Kannan, editors, Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, May 1992. pages 453-461, Carnegie Mellon University, 1992.

Abstract

Abstract is missing.