A parametric approach to solving bicriterion shortest path problems
From MaRDI portal
Publication:810382
Recommendations
- Efficient solution generation for the bicriterion shortest path problems
- An empirical investigation of some bicriterion shortest path algorithms
- An interactive procedure using domination cones for bicriterion shortest path problems
- On a special class of bicriterion path problems
- scientific article; zbMATH DE number 4179156
- A label correcting approach for solving bicriterion shortest-path problems
- Two-phase algorithms for the parametric shortest path problem
- On a multicriteria shortest path problem
- Algorithms for time-dependent bicriteria shortest path problems
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
Cites work
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 3478624 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A bicriterion shortest path algorithm
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- A note on two problems in connexion with graphs
- An algorithm for bicriterion linear programming
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Finding the K Shortest Loopless Paths in a Network
- Linear Multiparametric Programming by Multicriteria Simplex Method
- On a routing problem
- Shortest-path algorithms: Taxonomy and annotation
- Solving Bicriterion Mathematical Programs
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- The shortest path problem with two objective functions
Cited in
(39)- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- Efficient solution generation for the bicriterion shortest path problems
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
- The interactive analysis of the multicriteria shortest path problem by the reference point method.
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- An empirical investigation of some bicriterion shortest path algorithms
- Multicriteria adaptive paths in stochastic, time-varying networks
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
- Label correcting methods to solve multicriteria shortest path problems
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- A label correcting approach for solving bicriterion shortest-path problems
- The Steiner bi-objective shortest path problem
- On a parametric shortest path problem from primal—dual multicommodity network optimization
- A biobjective Dijkstra algorithm
- Multiobjective routing problems
- Analysis of FPTASes for the multi-objective shortest path problem
- On the sum-max bicriterion path problem.
- Clusters of non-dominated solutions in multiobjective combinatorial optimization: an experimental analysis
- Algorithms for time-dependent bicriteria shortest path problems
- Routing with nonlinear multiattribute cost functions
- A genetic algorithms to solve the bicriteria shortest path problem
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
- A comparison of solution strategies for biobjective shortest path problems
- On the cardinality of the Pareto set in bicriteria shortest path problems
- On a special class of bicriterion path problems
- An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
- Solving multi-objective traffic assignment
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- A preference-based approach to spanning trees and shortest paths problems
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
- A relation of dominance for the bicriterion bus routing problem
- Extended dominance and a stochastic shortest path problem
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- The \(k\)-centrum shortest path problem
- A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
- Optimal paths in bi-attribute networks with fractional cost functions
This page was built for publication: A parametric approach to solving bicriterion shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810382)
