Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
From MaRDI portal
Publication:4687213
DOI10.1002/net.21815zbMath1397.90336OpenAlexW2792585709MaRDI QIDQ4687213
Anita Schöbel, Andrea Raith, Lisa Thom, Marie E. Schmidt
Publication date: 11 October 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21815
multi-objective optimizationrobust optimizationshortest path problemmulti-objective robust optimizationlabel correcting algorithmfinite uncertainty
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items (9)
Dominance for multi-objective robust optimization concepts ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ An improved multiobjective shortest path algorithm ⋮ Targeted multiobjective Dijkstra algorithm ⋮ Algorithms for the minmax regret path problem with interval data ⋮ Generalized nash fairness solutions for bi‐objective minimization problems ⋮ Min-ordering and max-ordering scalarization methods for multi-objective robust optimization ⋮ New advances and applications in deterministic and stochastic network optimization ⋮ The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
Uses Software
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Minmax robustness for multi-objective optimization problems
- Bi-objective robust optimisation
- Generalized light robustness and the trade-off between robustness and nominal quality
- A preference-based approach to spanning trees and shortest paths problems
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
- On a multicriteria shortest path problem
- Shortest paths in networks with vector weights
- A comparison of solution strategies for biobjective shortest path problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- On a domination property for vector maximization with respect to cones
- On the robust shortest path problem.
- Robust discrete optimization and network flows
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- An empirical investigation of some bicriterion shortest path algorithms
- Monotonicity and the principle of optimality
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- A label correcting approach for solving bicriterion shortest-path problems
- The relationship between multi-objective robustness concepts and set-valued optimization
- Dynamic programming in multiplicative lattices
- On robust multiobjective optimization
- The robust shortest path problem with interval data via Benders decomposition
- On a routing problem
- The Principle of Optimality in Dynamic Programming with Returns in Partially Ordered Sets
- Linear Multiple Objective Problems with Interval Coefficients
- Solving min-max shortest-path problems on a network
- Minmax regret combinatorial optimization problems: an Algorithmic Perspective
- Multicriteria Optimization
- Near-shortest and K-shortest simple paths
- Composition Principles for Synthesis of Optimal Multistage Processes
- Label correcting methods to solve multicriteria shortest path problems
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
This page was built for publication: Extensions of labeling algorithms for multi‐objective uncertain shortest path problems