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

4,14 durchschnittliche Bewertung
( 7 Bewertungen bei Goodreads )
 
9780691129938: The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

From the Back Cover:

"This book addresses one of the most famous and important combinatorial-optimization problems--the traveling salesman problem. It is very well written, with a vivid style that captures the reader's attention. Many examples are provided that are very useful to motivate and help the reader to better understand the results presented in the book."--Matteo Fischetti, University of Padova

"This is a fantastic book. Ever since the early days of discrete optimization, the traveling salesman problem has served as the model for computationally hard problems. The authors are main players in this area who forged a team in 1988 to push the frontiers on how good we are in solving hard and large traveling salesman problems. Now they lay out their views, experience, and findings in this book."--Bert Gerards, Centrum voor Wiskunde en Informatica

About the Author:

David L. Applegate is a researcher at AT&T Labs. Robert E. Bixby is Research Professor of Management and Noah Harding Professor of Computational and Applied Mathematics at Rice University. Vasek Chvátal is Canada Research Chair in Combinatorial Optimization at Concordia University. William J. Cook is Chandler Family Chair in Industrial and Systems Engineering at the Georgia Institute of Technology.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Beste Suchergebnisse bei AbeBooks

1.

David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook
ISBN 10: 0691129932 ISBN 13: 9780691129938
Neu Anzahl: 3
Anbieter
Speedy Hen LLC
(Sunrise, FL, USA)
Bewertung
[?]

Buchbeschreibung Buchzustand: New. Bookseller Inventory # ST0691129932. Buchnummer des Verkäufers ST0691129932

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 77,17
Währung umrechnen

In den Warenkorb

Versand: Gratis
Innerhalb USA
Versandziele, Kosten & Dauer

2.

David L. Applegate, Robert E. Bixby, Vasek Chvatal
Verlag: Princeton University Press, United States (2007)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Neu Hardcover Anzahl: 1
Anbieter
The Book Depository
(London, Vereinigtes Königreich)
Bewertung
[?]

Buchbeschreibung Princeton University Press, United States, 2007. Hardback. Buchzustand: New. Language: English . Brand New Book. 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. Buchnummer des Verkäufers AAZ9780691129938

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 77,53
Währung umrechnen

In den Warenkorb

Versand: Gratis
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

3.

David L. Applegate, Robert E. Bixby, Vasek Chvatal
Verlag: Princeton University Press, United States (2007)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Neu Hardcover Anzahl: 1
Anbieter
The Book Depository US
(London, Vereinigtes Königreich)
Bewertung
[?]

Buchbeschreibung Princeton University Press, United States, 2007. Hardback. Buchzustand: New. Language: English . Brand New Book. 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. Buchnummer des Verkäufers AAZ9780691129938

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 77,90
Währung umrechnen

In den Warenkorb

Versand: Gratis
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

4.

Applegate, David L./ Bixby, Robert E./ Chvatal, Vasek/ Cook, William J.
Verlag: Princeton University Press 2007-01-15 (2007)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Neu Hardcover Anzahl: 3
Anbieter
Chiron Media
(Wallingford, Vereinigtes Königreich)
Bewertung
[?]

Buchbeschreibung Princeton University Press 2007-01-15, 2007. HARDCOVER. Buchzustand: New. Buchnummer des Verkäufers NU-GRD-00562719

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 75,08
Währung umrechnen

In den Warenkorb

Versand: EUR 3,39
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

5.

David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
Verlag: Princeton University Press 2007-01-15, Princeton |Oxford (2007)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Neu Hardcover Anzahl: 10
Anbieter
Blackwell's
(Oxford, OX, Vereinigtes Königreich)
Bewertung
[?]

Buchbeschreibung Princeton University Press 2007-01-15, Princeton |Oxford, 2007. hardback. Buchzustand: New. Buchnummer des Verkäufers 9780691129938

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 75,43
Währung umrechnen

In den Warenkorb

Versand: EUR 6,81
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

6.

David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook
ISBN 10: 0691129932 ISBN 13: 9780691129938
Neu Anzahl: 3
Anbieter
Speedy Hen
(London, Vereinigtes Königreich)
Bewertung
[?]

Buchbeschreibung Buchzustand: New. Bookseller Inventory # ST0691129932. Buchnummer des Verkäufers ST0691129932

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 63,90
Währung umrechnen

In den Warenkorb

Versand: EUR 21,55
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

7.

Applegate, David L.; Bixby, Robert E.; Chvatal, Vasek; Cook, William J.
Verlag: Princeton University Press (2007)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Neu Hardcover Anzahl: 3
Bewertung
[?]

Buchbeschreibung Princeton University Press, 2007. Buchzustand: New. 2007. 2nd Printing. Hardcover. Presents the findings on one of the most intensely investigated subjects in computational mathematics - the travelling salesman problem. This book describes the method and computer code used to solve a range of large-scale problems, and demonstrates the interplay of applied mathematics with increasingly powerful computing platforms. Series: Princeton Series in Applied Mathematics. Num Pages: 608 pages, 200 line illus. BIC Classification: PBW; UYA. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 241 x 165 x 43. Weight in Grams: 1056. . . . . . . Buchnummer des Verkäufers V9780691129938

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 86,97
Währung umrechnen

In den Warenkorb

Versand: Gratis
Von Irland nach USA
Versandziele, Kosten & Dauer

8.

David L. Applegate
Verlag: Princeton University Press
ISBN 10: 0691129932 ISBN 13: 9780691129938
Neu Hardcover Anzahl: 3
Anbieter
THE SAINT BOOKSTORE
(Southport, Vereinigtes Königreich)
Bewertung
[?]

Buchbeschreibung Princeton University Press. Hardcover. Buchzustand: New. New copy - Usually dispatched within 2 working days. Buchnummer des Verkäufers B9780691129938

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 83,23
Währung umrechnen

In den Warenkorb

Versand: EUR 7,87
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

9.

David L. Applegate, Robert E. Bixby, Vasek Chvatal, William J. Cook
ISBN 10: 0691129932 ISBN 13: 9780691129938
Neu Hardcover Anzahl: 3
Anbieter
Ria Christie Collections
(Uxbridge, Vereinigtes Königreich)
Bewertung
[?]

Buchbeschreibung Hardback. Buchzustand: New. Not Signed; 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. book. Buchnummer des Verkäufers ria9780691129938_rkm

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 86,86
Währung umrechnen

In den Warenkorb

Versand: EUR 4,39
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

10.

Applegate, David L.; Bixby, Robert E.; Chvatal, Vasek; Cook, William J.
Verlag: Princeton University Press
ISBN 10: 0691129932 ISBN 13: 9780691129938
Neu Hardcover Anzahl: 3
Anbieter
Kennys Bookstore
(Olney, MD, USA)
Bewertung
[?]

Buchbeschreibung Princeton University Press. Buchzustand: New. 2007. 2nd Printing. Hardcover. Presents the findings on one of the most intensely investigated subjects in computational mathematics - the travelling salesman problem. This book describes the method and computer code used to solve a range of large-scale problems, and demonstrates the interplay of applied mathematics with increasingly powerful computing platforms. Series: Princeton Series in Applied Mathematics. Num Pages: 608 pages, 200 line illus. BIC Classification: PBW; UYA. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 241 x 165 x 43. Weight in Grams: 1056. . . . . . Books ship from the US and Ireland. Buchnummer des Verkäufers V9780691129938

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 94,11
Währung umrechnen

In den Warenkorb

Versand: Gratis
Innerhalb USA
Versandziele, Kosten & Dauer

Es gibt weitere Exemplare dieses Buches

Alle Suchergebnisse ansehen