Extensions of labeling algorithms for multi-objective uncertain shortest path problems
From MaRDI portal
Recommendations
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
- On the robust shortest path problem.
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
- A multi-objective shortest path problem
Cites work
- A comparison of solution strategies for biobjective shortest path problems
- A label correcting approach for solving bicriterion shortest-path problems
- A note on two problems in connexion with graphs
- A preference-based approach to spanning trees and shortest paths problems
- An empirical investigation of some bicriterion shortest path algorithms
- Bi-objective robust optimisation
- Composition Principles for Synthesis of Optimal Multistage Processes
- Dynamic programming in multiplicative lattices
- Generalized light robustness and the trade-off between robustness and nominal quality
- Label correcting methods to solve multicriteria shortest path problems
- Linear Multiple Objective Problems with Interval Coefficients
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax regret combinatorial optimization problems: an algorithmic perspective
- Minmax robustness for multi-objective optimization problems
- Monotonicity and the principle of optimality
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
- Multicriteria Optimization
- Near-shortest and K-shortest simple paths
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- On a domination property for vector maximization with respect to cones
- On a multicriteria shortest path problem
- On a routing problem
- On robust multiobjective optimization
- On the robust shortest path problem.
- Robust discrete optimization and network flows
- Robust shortest path problems
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- Shortest paths in networks with vector weights
- Solving min-max shortest-path problems on a network
- The Principle of Optimality in Dynamic Programming with Returns in Partially Ordered Sets
- The minmax regret robust shortest path problem in a finite multi-scenario model
- The relationship between multi-objective robustness concepts and set-valued optimization
- The robust shortest path problem with interval data via Benders decomposition
Cited in
(14)- Algorithms for the minmax regret path problem with interval data
- Editorial: New advances and applications in deterministic and stochastic network optimization
- Routing in multimodal transportation networks with non-scheduled lines
- Dominance for multi-objective robust optimization concepts
- Uncertain multi-objective multi-route shortest path problem by robust enhanced non-dominated sorting genetic algorithms: application to emergency medical services
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
- Generalized nash fairness solutions for bi‐objective minimization problems
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
- Approaches for biobjective integer linear robust optimization
- Enhanced non-dominated sorting genetic algorithms for uncertain multi-objective shortest path problem: application to fire prevention services
- Targeted multiobjective Dijkstra algorithm
- An improved multiobjective shortest path algorithm
- Robust and distributionally robust shortest path problems: a survey
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
This page was built for publication: Extensions of labeling algorithms for multi-objective uncertain shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4687213)
