| Article ID: | iaor2002484 |
| Country: | United States |
| Volume: | 114 |
| Issue: | 2/3 |
| Start Page Number: | 249 |
| End Page Number: | 253 |
| Publication Date: | Sep 2000 |
| Journal: | Applied Mathematics and Computation |
| Authors: | Longani V. |
In this paper a simple algorithm for finding upper bounds of the solution of the traveling salesman problem is discussed.