Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 19,31
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 21,71
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 21,22
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 30,17
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 32,57
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 34,59
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 28,86
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 31,91
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 36,38
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 42,17
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 1025088700 ISBN 13: 9781025088709
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 27,32
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware - In this research, we consider stochastic and dynamic transportation network problems. Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network. First, we develop an algorithm for solving an independent expected shortest path problem. Next, we incorporate the inherent dependencies along successive links in two distinct ways to find the expected shortest path. Since the dependent expected shortest path problem cannot be solved with traditional deterministic approaches, we develop a heuristic based on the K-shortest path algorithm for this dependent stochastic network problem. Additionally, transient and asymptotic versions of the problem are considered. An algorithm to compute a parametric total travel time distribution for the shortest path is presented along with stochastically shortest path measures. The work extends the current literature on such problems by considering interactions on adjacent links.This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.
Idioma: Inglés
Publicado por Creative Media Partners, LLC, 2025
ISBN 10: 1025088700 ISBN 13: 9781025088709
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 22,02
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Idioma: Inglés
Publicado por Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 1025084047 ISBN 13: 9781025084046
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 45,54
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware.
Idioma: Inglés
Publicado por Creative Media Partners, LLC, 2025
ISBN 10: 1025088700 ISBN 13: 9781025088709
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 20,45
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 101,48
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Idioma: Inglés
Publicado por Creative Media Partners, LLC, 2025
ISBN 10: 1025084047 ISBN 13: 9781025084046
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 35,51
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHRD. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 27,92
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 33,33
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Idioma: Inglés
Publicado por Creative Media Partners, LLC, 2025
ISBN 10: 1025084047 ISBN 13: 9781025084046
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 32,47
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHRD. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 28,02
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 38,87
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 44,90
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 39,50
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Librería: CitiRetail, Stevenage, Reino Unido
EUR 23,87
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. In this research, we consider stochastic and dynamic transportation network problems. Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network. First, we develop an algorithm for solving an independent expected shortest path problem. Next, we incorporate the inherent dependencies along successive links in two distinct ways to find the expected shortest path. Since the dependent expected shortest path problem cannot be solved with traditional deterministic approaches, we develop a heuristic based on the K-shortest path algorithm for this dependent stochastic network problem. Additionally, transient and asymptotic versions of the problem are considered. An algorithm to compute a parametric total travel time distribution for the shortest path is presented along with stochastically shortest path measures. The work extends the current literature on such problems by considering interactions on adjacent links.This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 72,75
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 162.
Librería: CitiRetail, Stevenage, Reino Unido
EUR 36,40
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Hardcover. In this research, we consider stochastic and dynamic transportation network problems. Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network. First, we develop an algorithm for solving an independent expected shortest path problem. Next, we incorporate the inherent dependencies along successive links in two distinct ways to find the expected shortest path. Since the dependent expected shortest path problem cannot be solved with traditional deterministic approaches, we develop a heuristic based on the K-shortest path algorithm for this dependent stochastic network problem. Additionally, transient and asymptotic versions of the problem are considered. An algorithm to compute a parametric total travel time distribution for the shortest path is presented along with stochastically shortest path measures. The work extends the current literature on such problems by considering interactions on adjacent links.This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.