DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
From MaRDI portal
Publication:5249002
DOI10.1142/S0129054199000186zbMath1319.68163OpenAlexW2112643276MaRDI QIDQ5249002
José Luís Esteves dos Santos, Marta M. B. Pascoal, Ernesto de Queirós Vieira Martins
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054199000186
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (28)
Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ The minmax regret robust shortest path problem in a finite multi-scenario model ⋮ Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly ⋮ A comprehensive survey on the quickest path problem ⋮ An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks ⋮ Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution ⋮ Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks ⋮ Enumerating \(K\) best paths in length order in DAGs ⋮ Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations ⋮ On a relaxed maximally disjoint path pair problem: a bicriteria approach ⋮ An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks ⋮ Solving bicriteria 0--1 knapsack problems using a labeling algorithm. ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes ⋮ A new multiobjective dynamic routing method for multiservice networks: modelling and performance ⋮ An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs ⋮ On a bi-dimensional dynamic alternative routing method ⋮ Suboptimal target control for hybrid automata using model predictive control ⋮ Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa ⋮ The determination of the path with minimum-cost norm value ⋮ A bicriterion approach for routing problems in multimedia networks ⋮ Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction ⋮ Balanced-flow algorithm for path network planning in hierarchical spaces ⋮ On the shortest path problem with negative cost cycles ⋮ Finding non-dominated bicriteria shortest pairs of disjoint simple paths ⋮ An Experimental Study on Approximating k Shortest Simple Paths
Cites Work
- A note on two problems in connexion with graphs
- An algorithm for ranking paths that may contain cycles
- A bicriterion shortest path algorithm
- An algorithm for the ranking of shortest paths
- A computational improvement for a shortest paths ranking algorithm
- On algorithms for finding the k shortest paths in a network
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- A Method for the Solution of the N th Best Path Problem
- Shortest path methods: A unifying approach
- An efficient algorithm for K shortest simple paths
- Disjoint paths in a network
- Iterative methods for determining the k shortest paths in a network
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- An Appraisal of Some Shortest-Path Algorithms
- Finding the K Shortest Loopless Paths in a Network
This page was built for publication: DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
