Robust constrained shortest path problems under budgeted uncertainty
From MaRDI portal
Recommendations
- Probabilistic shortest path problems with budgetary constraints
- Robust shortest path problems with two uncertain multiplicative cost coefficients
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- Robust shortest path problems
- Robust shortest path planning and semicontractive dynamic programming
- An approach to the distributionally robust shortest path problem
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- On the robust shortest path problem.
- Constrained shortest path with uncertain transit times
- On the multistage shortest path problem under distributional uncertainty
Cited in
(19)- The robust vehicle routing problem with time windows: solution by branch and price and cut
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- Exact algorithms for the chance-constrained vehicle routing problem
- A generalized shortest path tour problem with time windows
- The continuous maximum capacity path interdiction problem
- Robust drone selective routing in humanitarian transportation network assessment
- Robust vehicle routing under uncertainty via branch-price-and-cut
- Robust combinatorial optimization with locally budgeted uncertainty
- Shortest path network problems with stochastic arc weights
- Shortest path tour problem with time windows
- Robust scheduling with budgeted uncertainty
- Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
- A dynamic programming approach for a class of robust optimization problems
- Robust shortest path planning and semicontractive dynamic programming
- Constrained shortest path with uncertain transit times
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty
- Robust and distributionally robust shortest path problems: a survey
This page was built for publication: Robust constrained shortest path problems under budgeted uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642442)
