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

4,14 valoración promedio
( 7 valoraciones por GoodReads )
 
9780691129938: The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Críticas:


Winner of the 2007 Lanchester Prize, Informs

"The authors have done a wonderful job of explaining how they developed new techniques in response to the challenges posed by ever larger instances of the Traveling Salesman Problem." --MAA Online


"By bringing together the best work from a wide array of researchers, advancing the field where needed, describing their findings in a book, and implementing everything in an extremely well-written computer program, the authors show how research in computational combinatorial optimization should be done." --Michael Trick, Operations Research Letters


"The book is certainly a must for every researcher in practical TSP-computation." --Ulrich Faigle, Mathematical Reviews


"It is very well written and clearly structured. Many examples are provided, which help the reader to better understand the presented results. The authors succeed in describing the TSP problem, beginning with its history, and the first approaches, and ending with the state of the art." --Stefan Nickel, Zentralblatt MATH


"[T]the text read[s] more like a best-seller than a tome of mathematics. . . . The resulting book provides not only a map for understanding TSP computation, but should be the starting point for anyone interested in launching a computational assault on any combinatorial optimization problem." --Jan Karel Lenstra, SIAM Review


"By bringing together the best work from a wide array of researchers, advancing the field where needed, describing their findings in a book, and implementing everything in an extremely well-written computer program, the authors show how research in computational combinatorial optimization should be done." --Michael Trick, ScienceDirect


"[T]he book provides a comprehensive treatment of the traveling salesman problem and I highly recommend it not only to specialists in the area but to anyone interested in combinatorial optimization." --EMS Newsletter

Reseña del editor:


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.


"Sobre este título" puede pertenecer a otra edición de este libro.

Comprar nuevo Ver libro

Gastos de envío: EUR 10,45
De Reino Unido a Estados Unidos de America

Destinos, gastos y plazos de envío

Añadir al carrito

Los mejores resultados en AbeBooks

1.

David L. Applegate
Editorial: Princeton University Press (2007)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Cantidad: 6
Librería
Books2Anywhere
(Fairford, GLOS, Reino Unido)
Valoración
[?]

Descripción Princeton University Press, 2007. HRD. Estado de conservación: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Nº de ref. de la librería WP-9780691129938

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 63,33
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 10,45
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

2.

David L. Applegate, Robert E. Bixby, Vasek Chvatal
Editorial: Princeton University Press, United States (2007)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Tapa dura Cantidad: 1
Librería
The Book Depository US
(London, Reino Unido)
Valoración
[?]

Descripción Princeton University Press, United States, 2007. Hardback. Estado de conservación: New. 234 x 162 mm. 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. Nº de ref. de la librería AAZ9780691129938

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 77,38
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

3.

David L. Applegate, Robert E. Bixby, Vasek Chvatal
Editorial: Princeton University Press, United States (2007)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Tapa dura Cantidad: 1
Librería
The Book Depository
(London, Reino Unido)
Valoración
[?]

Descripción Princeton University Press, United States, 2007. Hardback. Estado de conservación: New. 234 x 162 mm. 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. Nº de ref. de la librería AAZ9780691129938

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 77,42
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

4.

Applegate, David L.; Bixby, Robert E.; Cook, William J.
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Cantidad: 1
Librería
Speedy Hen LLC
(Sunrise, FL, Estados Unidos de America)
Valoración
[?]

Descripción Estado de conservación: New. Bookseller Inventory # ST0691129932. Nº de ref. de la librería ST0691129932

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 79,27
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
A Estados Unidos de America
Destinos, gastos y plazos de envío

5.

David L. Applegate, Robert E. Bixby, Vasek Chvatal
Editorial: Princeton University Press 2007-01-15, New Jersey (2007)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Tapa dura Cantidad: 10
Librería
Blackwell's
(Oxford, OX, Reino Unido)
Valoración
[?]

Descripción Princeton University Press 2007-01-15, New Jersey, 2007. hardback. Estado de conservación: New. Nº de ref. de la librería 9780691129938

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 77,19
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 5,22
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

6.

Applegate, David L.; Bixby, Robert E.; Chvatal, Vasek; Cook, William J.
Editorial: Princeton University Press (2007)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Tapa dura Cantidad: 1
Librería
Valoración
[?]

Descripción Princeton University Press, 2007. Estado de conservación: 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. . . . . . . Nº de ref. de la librería V9780691129938

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 87,59
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Irlanda a Estados Unidos de America
Destinos, gastos y plazos de envío

7.

David L. Applegate, Robert E. Bixby, Vasek Chvatal, William J. Cook
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Tapa dura Cantidad: 1
Librería
Ria Christie Collections
(Uxbridge, Reino Unido)
Valoración
[?]

Descripción Hardback. Estado de conservación: 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. Nº de ref. de la librería ria9780691129938_rkm

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 86,60
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 3,88
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

8.

Applegate, David L.; Bixby, Robert E.; Cook, William J.
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Cantidad: 1
Librería
BWB
(Valley Stream, NY, Estados Unidos de America)
Valoración
[?]

Descripción Estado de conservación: New. Depending on your location, this item may ship from the US or UK. Nº de ref. de la librería 97806911299380000000

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 93,29
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
A Estados Unidos de America
Destinos, gastos y plazos de envío

9.

Applegate, David L.; Bixby, Robert E.; Chvatal, Vasek; Cook, William J.
Editorial: Princeton University Press
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Tapa dura Cantidad: 1
Librería
Kennys Bookstore
(Olney, MD, Estados Unidos de America)
Valoración
[?]

Descripción Princeton University Press. Estado de conservación: 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. Nº de ref. de la librería V9780691129938

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 93,63
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
A Estados Unidos de America
Destinos, gastos y plazos de envío

10.

David L. Applegate; Robert E. Bixby; Vasek Chvatal; William J. Cook
Editorial: Princeton University Press (2007)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Tapa dura Cantidad: 1
Librería
Ergodebooks
(RICHMOND, TX, Estados Unidos de America)
Valoración
[?]

Descripción Princeton University Press, 2007. Hardcover. Estado de conservación: New. Nº de ref. de la librería SONG0691129932

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 91,43
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 3,70
A Estados Unidos de America
Destinos, gastos y plazos de envío

Existen otras copia(s) de este libro

Ver todos los resultados de su búsqueda