Stochastic shortest path problems with piecewise-linear concave utility functions
From MaRDI portal
Recommendations
- Maximizing expected utility for stochastic combinatorial optimization problems
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- Models and algorithm for stochastic shortest path problem
- Probabilistic shortest path problems with budgetary constraints
- A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
Cited in
(13)- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks
- Joint chance constrained shortest path problem with Copula theory
- Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
- Shortest paths in stochastic networks with correlated link costs
- Algorithms for non-linear and stochastic resource constrained shortest path
- The constrained shortest path problem with stochastic correlated link travel times
- A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Almost stochastic dominance for most risk-averse decision makers
- Arc Reduction and Path Preference in Stochastic Acyclic Networks
- Maximizing expected utility for stochastic combinatorial optimization problems
- Optimal routing for maximizing the travel time reliability
This page was built for publication: Stochastic shortest path problems with piecewise-linear concave utility functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784083)
