You are currently offline. Some features of the site may not work correctly.

Corpus ID: 59762203

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

@inproceedings{Applegate2007TheTS,
title={The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)},
author={D. Applegate and R. Bixby and V. Chv{\'a}tal and W. Cook},
year={2007}
}

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… Expand