The Shortest Path Problem: Ninth DIMACS Implementation Challenge (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science)

0 valoración promedio
( 0 valoraciones por GoodReads )
 
9780821843833: The Shortest Path Problem: Ninth DIMACS Implementation Challenge (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science)
Reseña del editor:

Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. Shortest path algorithms have been studied since the 1950's and still remain an active area of research. This volume reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms. The infrastructure developed during the Challenge facilitated further research in the area, leading to substantial follow-up work as well as to better and more uniform experimental standards. The results of the Challenge included new cutting-edge techniques for emerging applications such as GPS navigation systems, providing experimental evidence of the most effective algorithms in several real-world settings.

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

Los mejores resultados en AbeBooks

1.

Andrew V. Goldberg, and David S. Johnson Camil Demetrescu; Editor-Camil Demetrescu; Editor-Andrew V. Goldberg; Editor-Divid S. Johnson
Editorial: American Mathematical Society, DIMACS (2009)
ISBN 10: 0821843834 ISBN 13: 9780821843833
Nuevos Tapa dura Cantidad: > 20
Librería
Sequitur Books
(Boonsboro, MD, Estados Unidos de America)
Valoración
[?]

Descripción American Mathematical Society, DIMACS, 2009. Hardcover. Estado de conservación: New. Brand new. We distribute directly for the publisher. Nº de ref. de la librería 1005110083

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

Comprar nuevo
EUR 91,51
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

2.

Andrew V. Goldberg
Editorial: American Mathematical Society, United States (2009)
ISBN 10: 0821843834 ISBN 13: 9780821843833
Nuevos Tapa dura Cantidad: 1
Librería
The Book Depository US
(London, Reino Unido)
Valoración
[?]

Descripción American Mathematical Society, United States, 2009. Hardback. Estado de conservación: New. 260 x 184 mm. Language: English . Brand New Book. Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. Shortest path algorithms have been studied since the 1950 s and still remain an active area of research. This volume reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms. The infrastructure developed during the Challenge facilitated further research in the area, leading to substantial follow-up work as well as to better and more uniform experimental standards. The results of the Challenge included new cutting-edge techniques for emerging applications such as GPS navigation systems, providing experimental evidence of the most effective algorithms in several real-world settings. Nº de ref. de la librería AAN9780821843833

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

Comprar nuevo
EUR 111,14
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.

Andrew V. Goldberg
ISBN 10: 0821843834 ISBN 13: 9780821843833
Nuevos Cantidad: 2
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 97808218438330000000

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

Comprar nuevo
EUR 112,44
Convertir moneda

Añadir al carrito

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

4.

Andrew V. Goldberg
Editorial: American Mathematical Society, United States (2009)
ISBN 10: 0821843834 ISBN 13: 9780821843833
Nuevos Tapa dura Cantidad: 1
Librería
The Book Depository
(London, Reino Unido)
Valoración
[?]

Descripción American Mathematical Society, United States, 2009. Hardback. Estado de conservación: New. 260 x 184 mm. Language: English . Brand New Book. Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. Shortest path algorithms have been studied since the 1950 s and still remain an active area of research. This volume reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms. The infrastructure developed during the Challenge facilitated further research in the area, leading to substantial follow-up work as well as to better and more uniform experimental standards. The results of the Challenge included new cutting-edge techniques for emerging applications such as GPS navigation systems, providing experimental evidence of the most effective algorithms in several real-world settings. Nº de ref. de la librería AAN9780821843833

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

Comprar nuevo
EUR 115,71
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

5.

Camil Demetrescu, Andrew V. Goldberg, David S. Johnson
Editorial: American Mathematical Society
ISBN 10: 0821843834 ISBN 13: 9780821843833
Nuevos Tapa dura Cantidad: 2
Librería
THE SAINT BOOKSTORE
(Southport, Reino Unido)
Valoración
[?]

Descripción American Mathematical Society. Hardback. Estado de conservación: new. BRAND NEW, The Shortest Path Problem: Ninth DIMACS Implementation Challenge, Camil Demetrescu, Andrew V. Goldberg, David S. Johnson, Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. Shortest path algorithms have been studied since the 1950's and still remain an active area of research. This volume reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms. The infrastructure developed during the Challenge facilitated further research in the area, leading to substantial follow-up work as well as to better and more uniform experimental standards. The results of the Challenge included new cutting-edge techniques for emerging applications such as GPS navigation systems, providing experimental evidence of the most effective algorithms in several real-world settings. Nº de ref. de la librería B9780821843833

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

Comprar nuevo
EUR 114,43
Convertir moneda

Añadir al carrito

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

6.

and David S. Johnson Camil Demetrescu, Andrew V. Goldberg, Andrew V. Goldberg (Editor), Camil Demetrescu (Editor), Divid S. Johnson (Editor)
Editorial: American Mathematical Society, DIMACS (2009)
ISBN 10: 0821843834 ISBN 13: 9780821843833
Nuevos Tapa dura Cantidad: 1
Librería
Ergodebooks
(RICHMOND, TX, Estados Unidos de America)
Valoración
[?]

Descripción American Mathematical Society, DIMACS, 2009. Hardcover. Estado de conservación: New. Nº de ref. de la librería DADAX0821843834

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

Comprar nuevo
EUR 133,50
Convertir moneda

Añadir al carrito

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

7.

Demetrescu, Camil (Editor)/ Goldberg, Andrew V. (Editor)/ Johnson, Divid S. (Editor)
Editorial: Amer Mathematical Society (2009)
ISBN 10: 0821843834 ISBN 13: 9780821843833
Nuevos Tapa dura Cantidad: 2
Librería
Revaluation Books
(Exeter, Reino Unido)
Valoración
[?]

Descripción Amer Mathematical Society, 2009. Hardcover. Estado de conservación: Brand New. 319 pages. 10.24x7.24x0.87 inches. In Stock. Nº de ref. de la librería __0821843834

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

Comprar nuevo
EUR 150,95
Convertir moneda

Añadir al carrito

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

8.

Camil Demetrescu
ISBN 10: 0821843834 ISBN 13: 9780821843833
Nuevos Tapa dura Cantidad: 1
Librería
Grand Eagle Retail
(Wilmington, DE, Estados Unidos de America)
Valoración
[?]

Descripción 2009. Hardcover. Estado de conservación: New. Hardcover. Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. This title reports on the research carrie.Shipping may be from multiple locations in the US or from the UK, depending on stock availability. 319 pages. 0.756. Nº de ref. de la librería 9780821843833

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

Comprar nuevo
EUR 163,79
Convertir moneda

Añadir al carrito

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

9.

Andrew V. Goldberg; and David S. Johnson Camil Demetrescu
Editorial: American Mathematical Society, DIMACS (2009)
ISBN 10: 0821843834 ISBN 13: 9780821843833
Nuevos Tapa dura Cantidad: 1
Librería
Irish Booksellers
(Rumford, ME, Estados Unidos de America)
Valoración
[?]

Descripción American Mathematical Society, DIMACS, 2009. Hardcover. Estado de conservación: New. book. Nº de ref. de la librería 0821843834

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

Comprar nuevo
EUR 167,77
Convertir moneda

Añadir al carrito

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

10.

Camil Demetrescu
ISBN 10: 0821843834 ISBN 13: 9780821843833
Nuevos Tapa dura Cantidad: 1
Librería
AussieBookSeller
(SILVERWATER, NSW, Australia)
Valoración
[?]

Descripción 2009. Hardcover. Estado de conservación: New. Hardcover. Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. This title reports on the re.Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. 319 pages. 0.756. Nº de ref. de la librería 9780821843833

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

Comprar nuevo
EUR 168,25
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 25,91
De Australia 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