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)

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

From the Inside Flap:


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

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

Los mejores resultados en AbeBooks

1.

Applegate, David L., Bixby, Robert E., Chvatal, Vasek, Cook, William J.
Editorial: Princeton University Press (2006)
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Cantidad: 1
Librería
Zubal-Books
(Cleveland, OH, Estados Unidos de America)
Valoración
[?]

Descripción Princeton University Press, 2006. Estado de conservación: New. *Price HAS BEEN reduced until Monday, July 31 for our ABEBOOKS JULY SALE* 608 pp., Hardcover, NEW!!!. Nº de ref. de la librería ZB1063546

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

Comprar nuevo
EUR 48,80
Convertir moneda

Añadir al carrito

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

2.

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 55,43
Convertir moneda

Añadir al carrito

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

3.

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 60,97
Convertir moneda

Añadir al carrito

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

4.

David L. Applegate, Robert E Bixby, Vasek Chvatal, William J Cook, Robert E. Bixby, Vasek Chvátal, William J. Cook
Editorial: Princeton University Press 2007-02-20, Princeton |Oxford (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-02-20, Princeton |Oxford, 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 68,49
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 3,35
De Reino Unido 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, 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. 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 74,65
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

6.

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. 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 74,65
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

7.

David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook
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 75,63
Convertir moneda

Añadir al carrito

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

8.

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 79,77
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

9.

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

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

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

Comprar nuevo
EUR 81,24
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
ISBN 10: 0691129932 ISBN 13: 9780691129938
Nuevos Tapa dura Cantidad: 1
Librería
THE SAINT BOOKSTORE
(Southport, Reino Unido)
Valoración
[?]

Descripción Princeton University Press. Hardback. Estado de conservación: new. BRAND NEW, The Traveling Salesman Problem: A Computational Study, David L. Applegate, Robert E. Bixby, Vasek Chvatal, William J. Cook, 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 B9780691129938

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

Comprar nuevo
EUR 74,92
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 7,76
De Reino Unido 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