The Traveling Salesman Problem And Its Variations
Download The Traveling Salesman Problem And Its Variations PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get The Traveling Salesman Problem And Its Variations book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
The Traveling Salesman Problem and Its Variations
Author: G. Gutin
language: en
Publisher: Springer Science & Business Media
Release Date: 2006-05-02
A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.
In Pursuit of the Traveling Salesman
Covers the history, applications, theory, and computation of the traveling salesman problem right up to state-of-the-art solution machinery.
The Traveling Salesman Problem
Author: David L. Applegate
language: en
Publisher: Princeton University Press
Release Date: 2011-09-19
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 authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.