A note on the complexity of the asymmetric traveling salesman problem

Authors:
Weixiong Zhang
Affiliations:
Information Sciences Institute and Department of Computer Science, University of Southern California, 4676 Admiralty Way, Marina del Rey, CA 90292-6695, USA
Venue:
Operations Research Letters
Year:
1997

Citing 1
Cited 2

Random Trees and the Analysis of Branch and Bound Procedures

Journal of the ACM (JACM)

A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

Computers and Operations Research
A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the most efficient approaches known for finding an optimal tour of the asymmetric traveling salesman problem (ATSP) is branch-and-bound (BnB) subtour elimination. For two decades, expert opinion has been divided over whether the expected complexity of the ATSP under BnB subtour elimination is polynomial or exponential in the number of cities. We show that the argument for polynomial expected complexity does not hold.