Librería: California Books, Miami, FL, Estados Unidos de America
EUR 21,12
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 18,79
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 20,64
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 31,68
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 1025088700 ISBN 13: 9781025088709
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 26,69
Convertir monedaCantidad 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.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 14,69
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 27,62
Convertir monedaCantidad 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 29,35
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 30,55
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 33,64
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 24,98
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 41,25
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 34,78
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 1025084047 ISBN 13: 9781025084046
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 44,53
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware.
Librería: CitiRetail, Stevenage, Reino Unido
EUR 22,41
Convertir monedaCantidad 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 40,54
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 54,10
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 50,42
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: CitiRetail, Stevenage, Reino Unido
EUR 34,79
Convertir monedaCantidad 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 45,36
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 64,19
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 162.
EUR 61,74
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. KlappentextrnrnIn 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 t.
Publicado por Creative Media Partners, LLC Okt 2012, 2012
ISBN 10: 1249600634 ISBN 13: 9781249600633
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 80,96
Convertir monedaCantidad 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.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 48,89
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 40,49
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 42,72
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 54,82
Convertir monedaCantidad 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: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 58,86
Convertir monedaCantidad 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.
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 60,62
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 189.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 64,78
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 162.