Constrained shortest path with uncertain transit times
From MaRDI portal
Publication:496598
DOI10.1007/s10898-015-0280-9zbMath1330.90121OpenAlexW2026701128MaRDI QIDQ496598
S. Mehdi Hashemi, Shaghayegh Mokarami
Publication date: 22 September 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0280-9
stochastic optimizationapproximation algorithmrobust optimizationuncertain optimizationconstrained shortest path
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Stochastic programming (90C15)
Related Items (5)
New reformulations of distributionally robust shortest path problem ⋮ Robust combinatorial optimization with knapsack uncertainty ⋮ Extreme value distributions for two kinds of path sums of Markov chain ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
Cites Work
- Unnamed Item
- Tractable stochastic analysis in high dimensions via robust optimization
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Data-driven robust optimization
- The sample average approximation method applied to stochastic routing problems: a computational study
- The shortest route problem with constraints
- Robust Convex Optimization
- Linear Programming under Uncertainty
- Stochastic Shortest Path Problem with Delay Excess Penalty
- The Price of Robustness
- A dual algorithm for the constrained shortest path problem
- Approximation Schemes for the Restricted Shortest Path Problem
- Robust Solutions to Uncertain Semidefinite Programs
- Robust Solutions to Least-Squares Problems with Uncertain Data
- A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
- Stochastic shortest path problems with recourse
- Stochastic Shortest Paths Via Quasi-convex Maximization
- On the complexity of a class of combinatorial optimization problems with uncertainty
This page was built for publication: Constrained shortest path with uncertain transit times