Abstract | Keywords | Export | Availability | Bookmark

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Traveling salesman problem. --- TSP (Traveling salesman problem) --- Combinatorial optimization --- Graph theory --- Vehicle routing problem --- AT&T Labs. --- Accuracy and precision. --- Addition. --- Algorithm. --- Analysis of algorithms. --- Applied mathematics. --- Approximation algorithm. --- Approximation. --- Basic solution (linear programming). --- Best, worst and average case. --- Bifurcation theory. --- Big O notation. --- CPLEX. --- CPU time. --- Calculation. --- Chaos theory. --- Column generation. --- Combinatorial optimization. --- Computation. --- Computational resource. --- Computer. --- Connected component (graph theory). --- Connectivity (graph theory). --- Convex hull. --- Cutting-plane method. --- Delaunay triangulation. --- Determinism. --- Disjoint sets. --- Dynamic programming. --- Ear decomposition. --- Engineering. --- Enumeration. --- Equation. --- Estimation. --- Euclidean distance. --- Euclidean space. --- Family of sets. --- For loop. --- Genetic algorithm. --- George Dantzig. --- Georgia Institute of Technology. --- Greedy algorithm. --- Hamiltonian path. --- Hospitality. --- Hypergraph. --- Implementation. --- Instance (computer science). --- Institute. --- Integer. --- Iteration. --- Linear inequality. --- Linear programming. --- Mathematical optimization. --- Mathematics. --- Model of computation. --- Neuroscience. --- Notation. --- Operations research. --- Optimization problem. --- Order by. --- Pairwise. --- Parameter (computer programming). --- Parity (mathematics). --- Percentage. --- Polyhedron. --- Polytope. --- Pricing. --- Princeton University. --- Processing (programming language). --- Project. --- Quantity. --- Reduced cost. --- Requirement. --- Result. --- Rice University. --- Rutgers University. --- Scientific notation. --- Search algorithm. --- Search tree. --- Self-similarity. --- Simplex algorithm. --- Solution set. --- Solver. --- Source code. --- Special case. --- Stochastic. --- Subroutine. --- Subsequence. --- Subset. --- Summation. --- Test set. --- Theorem. --- Theory. --- Time complexity. --- Trade-off. --- Travelling salesman problem. --- Tree (data structure). --- Upper and lower bounds. --- Variable (computer science). --- Variable (mathematics).