Dynamic programming and minimum risk paths
From MaRDI portal
Publication:2432847
DOI10.1016/J.EJOR.2005.03.042zbMATH Open1137.90592OpenAlexW2011592542MaRDI QIDQ2432847FDOQ2432847
Authors: Paolo Serafini
Publication date: 25 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.042
Recommendations
Cites Work
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- On a routing problem
- Title not available (Why is that?)
- The shortest route through a network with time-dependent internodal transit times
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modeling of transport risk for hazardous materials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shortest path with time constraints on movement and parking
- Shortest route with time dependent length of edges and limited delay possibilities in nodes
- Title not available (Why is that?)
Cited In (5)
- On the Minimum Risk-Sum Path Problem
- Hazardous material transportation problems: a comprehensive overview of models and solution approaches
- Extreme value distributions for two kinds of path sums of Markov chain
- \(N\)-gram distribution and unification gain problem and its optimal solution
- A new model for path planning with interval data
This page was built for publication: Dynamic programming and minimum risk paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432847)