scientific article; zbMATH DE number 1300391

MaRDI QIDQ4248930zbMATH OpenFDO

Authors Raymond K. Cheung

Publication date 10 June 1999

zbMATH Keywords

networkrouting policydynamic shortest pathdiscrete random

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

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

Cited in

(11)

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

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)