The Traveling Salesman Problem A Computational Study

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 rou...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Applegate, David L, Bixby, Robert E, Chvátal, Vašek, Cook, William J
Format:	E-Book Buch
Sprache:	Englisch
Veröffentlicht:	Princeton Princeton University Press 2011
Ausgabe:	1
Schriftenreihe:	Princeton series in applied mathematics
Schlagworte:	Abstract data type Algorithm AND gate Assignment problem Asymptotic analysis Authoritarianism Combinatorial optimization Commodity Computation Computing Confidence interval Control zone Convex hull Cost Cramer's rule Cray Y-MP Cutting-plane method Data structure Decomposition method (constraint satisfaction) Default rule Division of labour Do while loop Estimator Factorization Foreign direct investment Foreign national General Topics for Engineers George Dantzig Greedy algorithm Heuristic Heuristic argument Icosian game Implementation Insider Instance (computer science) Iteration Knight's tour Likelihood function Limit of a sequence Linear programming Margin of error MATHEMATICS MATHEMATICS / Applied Minimum-cost flow problem Nationalism Opportunism Opposition to immigration Order by Preference (economics) Preprocessor Pricing Pricing strategies Priority queue Quadratic assignment problem Quantity Regional variation Resentment Result Sampling bias Solver Standard deviation Subsidy Tailings Theft Time complexity Trade-off Transition point Traveling-salesman problem Travelling salesman problem Ubuntu (philosophy) Unrest User expectations Variance Vehicle routing problem Wheelbarrow Nationalism Resentment Regional variation Default rule Heuristic argument Division of labour Result Theft Margin of error Sampling bias Decomposition method (constraint satisfaction) Minimum-cost flow problem Data structure Likelihood function Estimator Trade-off Quadratic assignment problem Algorithm Tailings Wheelbarrow Convex hull Computation Control zone Insider Time complexity Heuristic Transition point Cray Y-MP Cutting-plane method Unrest Solver User expectations George Dantzig Vehicle routing problem Travelling salesman problem Iteration Computing Cost Implementation Variance Opposition to immigration Knight's tour Commodity Ubuntu (philosophy) Pricing Foreign direct investment Standard deviation AND gate Asymptotic analysis Abstract data type Preference (economics) Order by Assignment problem Linear programming Cramer's rule Quantity Opportunism Subsidy Priority queue Factorization Authoritarianism Instance (computer science) Confidence interval Do while loop Limit of a sequence Icosian game Greedy algorithm Pricing strategies Preprocessor Foreign national
ISBN:	9780691129938, 0691129932, 1400841100, 9781400841103
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
Bibliographie:	Includes bibliographical references (p. [541]-581) and index
ISBN:	9780691129938 0691129932 1400841100 9781400841103
DOI:	10.1515/9781400841103