Dynamic programming and minimum risk paths

DOI10.1016/j.ejor.2005.03.042zbMath1137.90592OpenAlexW2011592542MaRDI QIDQ2432847

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

zbMATH Keywords

dynamic programmingrisk analysisroutingmultiple objective programminghazardous materials

Mathematics Subject Classification ID

Related Items (3)

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

Cites Work

• A note on two problems in connexion with graphs
• The shortest route through a network with time-dependent internodal transit times
• Modeling of Transport Risk for Hazardous Materials
• On a routing problem
• Shortest route with time dependent length of edges and limited delay possibilities in nodes
• Shortest path with time constraints on movement and parking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic programming and minimum risk paths