Deviation algorithms for ranking shortest paths
From MaRDI portal
Recommendations
Cites work
- A bicriterion shortest path algorithm
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- A computational improvement for a shortest paths ranking algorithm
- A Method for the Solution of the N th Best Path Problem
- A note on two problems in connexion with graphs
- An algorithm for ranking paths that may contain cycles
- An algorithm for the ranking of shortest paths
- An Appraisal of Some Shortest-Path Algorithms
- An efficient algorithm for K shortest simple paths
- Disjoint paths in a network
- Finding the K Shortest Loopless Paths in a Network
- Iterative methods for determining the k shortest paths in a network
- On algorithms for finding the k shortest paths in a network
- Shortest path methods: A unifying approach
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
Cited in
(34)- Finding non-dominated bicriteria shortest pairs of disjoint simple paths
- An algorithm for the ranking of shortest paths
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- Enumerating \(K\) best paths in length order in DAGs
- Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
- Balanced-flow algorithm for path network planning in hierarchical spaces
- Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
- A comprehensive survey on the quickest path problem
- Speeding up Martins' algorithm for multiple objective shortest path problems
- A new multiobjective dynamic routing method for multiservice networks: modelling and performance
- Suboptimal target control for hybrid automata using model predictive control
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations
- The minmax regret robust shortest path problem in a finite multi-scenario model
- An experimental study on approximating k shortest simple paths
- Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution
- A hierarchical multiobjective routing model for MPLS networks with two service classes
- A k shortest path algorithm for adaptive routing in communications networks
- 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
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- On a bi-dimensional dynamic alternative routing method
- On the shortest path problem with negative cost cycles
- 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
- K-shortest simple paths using biobjective path search
- Any-k algorithms for enumerating ranked answers to conjunctive queries
- An algorithm for ranking paths that may contain cycles
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
- Solving k-shortest and constrained shortest path problems efficiently
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
This page was built for publication: Deviation algorithms for ranking shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249002)
