Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights

DOI10.1016/J.COR.2022.106085MaRDI QIDQ2108190zbMATH OpenOpenAlexFDO

Authors Peter Buchholz, Iryna Dohndorf

Publication date 19 December 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2022.106085

zbMATH Keywords

applied probabilitycorrelated random variablesMarkov decision processesphase type distributionsshortest path problemsstochastic graphs

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• PH-graphs for analyzing shortest path problems with correlated traveling times
• A multi-objective approach for PH-graphs with applications to stochastic shortest paths
• Stochastic shortest path problems with recourse
• Models and algorithm for stochastic shortest path problem
• Methodology for Stochastic Graph Completion-Time Problems

Cites work

• A multi-objective approach for PH-graphs with applications to stochastic shortest paths
• A New Measure of Travel Time Reliability for In-Vehicle Navigation Systems
• A Review on Phase-type Distributions and their Use in Risk Theory
• A survey of algorithmic methods for partially observed Markov decision processes
• An Analysis of Stochastic Shortest Path Problems
• Characterization of phase-type distributions
• Communication complexity of convex optimization
• Dynamic shortest path in stochastic dynamic networks: Ship routing problem
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
• Finding reliable shortest paths in road networks under uncertainty
• Future memories are not needed for large classes of POMDPs
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• scientific article; zbMATH DE number 846103 (Why is no real title available?)
• Input modeling with phase-type distributions and Markov models. Theory and applications
• Learning metric-topological maps for indoor mobile robot navigation
• Minimizing risk models in Markov decision processes with policies depending on target values
• Minimizing risk models in stochastic shortest path problems
• Modelling Vehicular Traffic Using the Discrete Time Markovian Arrival Process
• On the complexity of partially observed Markov decision processes
• On the online shortest path problem with limited arc cost dependencies
• Optimal paths in graphs with stochastic or multidimensional weights
• Path problems in networks
• PH-graphs for analyzing shortest path problems with correlated traveling times
• Risk management policies for dynamic capacity control
• Shortest paths in stochastic networks with correlated link costs
• Stochastic Online Shortest Path Routing: The Value of Feedback
• The Complexity of Markov Decision Processes
• The quadratic shortest path problem: complexity, approximability, and solution methods
• Transmission Scheduling for Optimizing Sensor Network Lifetime: A Stochastic Shortest Path Approach

Cited in

(3)

• Optimization problems for weighted graphs and related correlation estimates
• PH-graphs for analyzing shortest path problems with correlated traveling times
• Optimal Node Visitation in Stochastic Digraphs

This page was built for publication: Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108190)