Dynamic programming and minimum risk paths

DOI10.1016/J.EJOR.2005.03.042MaRDI QIDQ2432847zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dynamic programmingmultiple objective programmingrisk analysishazardous materialsrouting

Mathematics Subject Classification ID

Dynamic programming (90C39) Discrete location and assignment (90B80)

Recommendations

• On the Minimum Risk-Sum Path Problem
• Minimizing risk models in stochastic shortest path problems
• Time dependency in multiple objective dynamic programming
• Shortest path network problems with stochastic arc weights
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs

Cites work

• scientific article; zbMATH DE number 3137856 (Why is no real title available?)
• scientific article; zbMATH DE number 4070651 (Why is no real title available?)
• scientific article; zbMATH DE number 3691044 (Why is no real title available?)
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 3783030 (Why is no real title available?)
• scientific article; zbMATH DE number 3526709 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• A note on two problems in connexion with graphs
• Modeling of transport risk for hazardous materials
• On a routing problem
• Shortest path with time constraints on movement and parking
• Shortest route with time dependent length of edges and limited delay possibilities in nodes
• The shortest route through a network with time-dependent internodal transit times

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)