The minmax regret robust shortest path problem in a finite multi-scenario model
From MaRDI portal
Publication:279255
Recommendations
- Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
- On the robust shortest path problem.
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- New models for the robust shortest path problem: complexity, resolution and generalization
- Algorithms for the minmax regret path problem with interval data
Cites work
- A bicriterion shortest path algorithm
- A branch and bound algorithm for the robust shortest path problem with interval data.
- A new implementation of Yen's ranking loopless paths algorithm
- An enhanced exact procedure for the absolute robust shortest path problem
- An exact algorithm for the robust shortest path problem with interval data
- Deviation algorithms for ranking shortest paths
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finding the K Shortest Loopless Paths in a Network
- Finding the k Shortest Paths
- Minmax regret combinatorial optimization problems: an algorithmic perspective
- Network flows. Theory, algorithms, and applications.
- On the robust shortest path problem.
- Recent advances in robust optimization: an overview
- Reduction approaches for robust shortest path problems
- Robust discrete optimization and its applications
- Robust shortest path problems
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- Solving min-max shortest-path problems on a network
- The robust shortest path problem with interval data via Benders decomposition
- The robust spanning tree problem with interval data
Cited in
(22)- Algorithms for the minmax regret path problem with interval data
- Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions
- Fast robust shortest path computations
- Robust shortest path problems with two uncertain multiplicative cost coefficients
- Uncertain multi-objective multi-route shortest path problem by robust enhanced non-dominated sorting genetic algorithms: application to emergency medical services
- Extensions of labeling algorithms for multi-objective uncertain shortest path problems
- Reduction approaches for robust shortest path problems
- A minmax regret version of the time-dependent shortest path problem
- On the robust shortest path problem.
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- A note on different modelling approaches for the robust shortest path problem
- Shortest path network problems with stochastic arc weights
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- Robust shortest path problems
- A MILP-based VND for the min-max regret shortest path tree problem with interval costs
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- New models for the robust shortest path problem: complexity, resolution and generalization
- Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- The rough interval shortest path problem
This page was built for publication: The minmax regret robust shortest path problem in a finite multi-scenario model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q279255)
