The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is theâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2004

Highly Cited

2004

We present a Monte Carlo algorithm to find approximate solutions of the traveling salesman problem. The algorithm generatesâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- David Applegate, William J. Cook, AndrÃ© Rohe
- INFORMS Journal on Computing
- 2003

We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained Lin-Kernighan heuristic forâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Marco Dorigo
- 1999

Ant algorithms [18, 14, 19] are a recently developed, population-based approach which has been successfully applied to several NPâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

We describe an artificial ant colony capable of solving the traveling salesman problem (TSP). Ants of the artificial colony areâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Marco Dorigo, Luca Maria Gambardella
- IEEE Trans. Evolutionary Computation
- 1997

This paper introduces ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSPâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Manfred W. Padberg, Giovanni Rinaldi
- SIAM Review
- 1991

An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- S. Lin, Brian W. Kernighan
- Operations Research
- 1973

An Eflective Heuristic Algorithm for the Traveling. THE SYMMETRIC traveling-salesman problem is: Given an n by n symmetric matrixâ€¦Â (More)

Is this relevant?

Highly Cited

1962

Highly Cited

1962

- Richard Bellman
- J. ACM
- 1962

The well-known travelling salesman problem is the following: " A salesman is required ~,o visit once and only once each of nâ€¦Â (More)

Is this relevant?

Highly Cited

1960

Highly Cited

1960

- C. E. Miller, A. W. Tucker, R. A. Zemlin
- J. ACM
- 1960

It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problemsâ€¦Â (More)

Is this relevant?

Highly Cited

1954

Highly Cited

1954

- Vasek ChvÃ¡tal, William J. Cook, George B. Dantzig, Delbert Ray Fulkerson, Selmer M. Johnson
- 50 Years of Integer Programming
- 1954

The RAND Corporation in the early 1950s contained â€œwhat may have been the most remarkable group of mathematicians working onâ€¦Â (More)

Is this relevant?