| Description |
1 online resource (606 pages) |
|
text file |
| Summary |
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The autho. |
| Local Note |
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America |
| Subject |
Traveling salesman problem.
|
|
Traveling salesman problem. |
| Genre/Form |
Electronic books.
|
|
Electronic books.
|
| Added Author |
Bixby, Robert E.
|
|
Chvatal, Vasek.
|
|
Cook, William J.
|
| Other Form: |
Print version: Applegate, David L. Traveling Salesman Problem : A Computational Study. Princeton : Princeton University Press, ©2011 9780691129938 |
| ISBN |
9781400841103 (electronic book) |
|
1400841100 (electronic book) |
|
0691129932 |
|
9780691129938 |
|
1283256118 |
|
9781283256117 |
|
