Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions
From MaRDI portal
Publication:2784083
DOI10.1287/mnsc.44.11.S125zbMath0989.90502OpenAlexW2125916239MaRDI QIDQ2784083
Publication date: 17 April 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.44.11.s125
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Utility theory (91B16)
Related Items
Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ Shortest paths in stochastic networks with correlated link costs ⋮ Optimal routing for maximizing the travel time reliability ⋮ Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Almost Stochastic Dominance for Most Risk-Averse Decision Makers ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
