Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms

DOI10.2478/v10006-007-0023-2zbMath1120.93051OpenAlexW2148105250MaRDI QIDQ5308327

Zbigniew Tarapata

Publication date: 27 September 2007

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/207836

zbMATH Keywords

approximation algorithmrouting problemalgorithm complexitystochastic shortest pathmultiobjective shortest pathterrain-based modeling

Mathematics Subject Classification ID

Related Items (15)

Search for the best compromise solution on Multiobjective shortest path problem ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ Analysis of FPTASes for the multi-objective shortest path problem ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Network Models for Multiobjective Discrete Optimization ⋮ An improved multiobjective shortest path algorithm ⋮ Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ The multiple shortest path problem with path deconfliction ⋮ Bi-criteria path problem with minimum length and maximum survival probability ⋮ Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems ⋮ A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria ⋮ Combinatorial optimization in system configuration design ⋮ Convergence method, properties and computational complexity for Lyapunov games

Uses Software

• CPLEX

Cites Work

• On a multicriteria shortest path problem
• Shortest paths in networks with vector weights
• A parametric approach to solving bicriterion shortest path problems
• Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications
• Generalized dynamic programming for multicriteria optimization
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• Solving k-shortest and constrained shortest path problems efficiently
• The shortest path problem with two objective functions
• A bicriterion shortest path algorithm
• A multicriteria Pareto-optimal path algorithm
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
• An interactive procedure using domination cones for bicriterion shortest path problems
• On the sum-max bicriterion path problem.
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
• An empirical investigation of some bicriterion shortest path algorithms
• A survey and annotated bibliography of multiobjective combinatorial optimization
• An improved FPTAS for Restricted Shortest Path.
• Multi-objective routing within large scale facilities using open finite queueing networks
• A label correcting approach for solving bicriterion shortest-path problems
• Time dependency in multiple objective dynamic programming
• Multiobjective routing of hazardous materials in stochastic networks
• Optimal paths in graphs with stochastic or multidimensional weights
• A quick method for finding shortest pairs of disjoint paths
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership
• The Stochastic Shortest Route Problem
• Disjoint Paths in a Planar Graph—A General Theorem
• Approximation Schemes for the Restricted Shortest Path Problem
• Solving min-max shortest-path problems on a network
• Finding disjoint paths with different path-costs: Complexity and algorithms
• Finding the k Shortest Paths
• Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems
• A bicriterion approach for routing problems in multimedia networks
• The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
• On-line and dynamic algorithms for shortest path problems
• Automata, Languages and Programming
• A simple efficient approximation scheme for the restricted shortest path problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms