scientific article; zbMATH DE number 1300391

zbMATH Open0940.90014MaRDI QIDQ4248930FDOQ4248930

Authors: Raymond K. Cheung 

Publication date: 10 June 1999

Title of this publication is not available (Why is that?)

Recommendations

• Stochastic shortest path problems with recourse
• An Analysis of Stochastic Shortest Path Problems
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
• Dynamic shortest path problems with time-varying costs

zbMATH Keywords

networkrouting policydynamic shortest pathdiscrete random

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cited In (11)

• Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
• Dynamic journeying under uncertainty
• A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
• A flow allocation strategy for routing over multiple flow classes with an application to air cargo terminals
• Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network
• The dynamic shortest path problem with anticipation
• Dynamic shortest path in stochastic dynamic networks: Ship routing problem
• Label-setting methods for multimode stochastic shortest path problems on graphs
• Multicriteria adaptive paths in stochastic, time-varying networks
• Reference policies for non-myopic sequential network design and timing problems
• Stochastic shortest path problems with recourse

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248930)