Pages that link to "Item:Q5288142"

The following pages link to Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs (Q5288142):

Displaying 14 items.

• Linear programming formulation for strategic dynamic traffic assignment (Q264276) (← links)
• Optimal information location for adaptive routing (Q542094) (← links)
• The dynamic shortest path problem with anticipation (Q852944) (← links)
• Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function (Q1280137) (← links)
• An application of Lemke's method to a class of Markov decision problems (Q1610179) (← links)
• Vehicle dispatching with time-dependent travel times (Q1869392) (← links)
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks (Q1869511) (← links)
• Dynamic shortest path in stochastic dynamic networks: Ship routing problem (Q1869695) (← links)
• Dynamic vehicle routing: Status and prospects (Q1908300) (← links)
• Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights (Q2108190) (← links)
• Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network (Q2129372) (← links)
• Extreme value distributions for two kinds of path sums of Markov chain (Q2176396) (← links)
• Dynamic journeying under uncertainty (Q2253524) (← links)
• The covering Canadian traveller problem (Q2440168) (← links)