Recoverable robust shortest path problems
From MaRDI portal
Recommendations
- Robust shortest path problems
- The Exact Subgraph Recoverable Robust Shortest Path Problem
- On the robust shortest path problem.
- Reduction approaches for robust shortest path problems
- An approach to the distributionally robust shortest path problem
- On the recoverable robust traveling salesman problem
- An enhanced exact procedure for the absolute robust shortest path problem
- New reformulations of distributionally robust shortest path problem
- New models for the robust shortest path problem: complexity, resolution and generalization
- Recoverable Robust Combinatorial Optimization Problems
Cites work
- A Polynomial Solution to the Undirected Two Paths Problem
- Adjustable robust solutions of uncertain linear programs
- Combinatorial optimization. Theory and algorithms.
- On the approximability of minmax (regret) network optimization problems
- On the robust shortest path problem.
- Robust discrete optimization and network flows
- Robust Optimization of Large-Scale Systems
- Shortest chain subject to side constraints
- The concept of recoverable robustness, linear programming recovery, and railway applications
- The directed subgraph homeomorphism problem
- The Exact Subgraph Recoverable Robust Shortest Path Problem
- The Price of Robustness
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- The robust shortest path problem with interval data via Benders decomposition
Cited in
(31)- Algorithms and uncertainty sets for data-driven robust shortest path problems
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- A biobjective approach to recoverable robustness based on location planning
- A linear time algorithm for the robust recoverable selection problem
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
- Recoverable robust representatives selection problems with discrete budgeted uncertainty
- Wasserstein distributionally robust shortest path problem
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Recoverable robust spanning tree problem under interval uncertainty representations
- Robust recoverable and two-stage selection problems
- Robust recoverable 0-1 optimization problems under polyhedral uncertainty
- Robust shortest path planning and semicontractive dynamic programming
- Decomposition approaches for recoverable robust optimization problems
- On the recoverable robust traveling salesman problem
- The Exact Subgraph Recoverable Robust Shortest Path Problem
- scientific article; zbMATH DE number 7564410 (Why is no real title available?)
- Recoverable robust prize-collecting call control problem
- Min-max-min robust combinatorial optimization
- Minimizing recovery cost of network optimization problems
- On the complexity of robust multi-stage problems with discrete recourse
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
- Approximating the shortest path problem with scenarios
- Recoverable robust shortest path problem under interval budgeted uncertainty representations
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Parameterized complexity of submodular minimization under uncertainty
- Computational complexity of the recoverable robust shortest path problem with discrete recourse
- Parameterized complexity of submodular minimization under uncertainty
- On the complexity of recoverable robust optimization in the polynomial hierarchy
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
This page was built for publication: Recoverable robust shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892155)