An algorithm for ranking paths that may contain cycles
From MaRDI portal
Publication:759658
DOI10.1016/0377-2217(84)90269-8zbMath0553.90099OpenAlexW2027442194MaRDI QIDQ759658
Ernesto de Queirós Vieira Martins
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90269-8
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05)
Related Items
Finding \(K\) shortest looping paths in a traffic-light network ⋮ Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs ⋮ Generalized route planning model for hazardous material transportation with VaR and equity considerations ⋮ Shortest paths avoiding forbidden subpaths ⋮ Multiobjective routing problems ⋮ Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations ⋮ The Steiner bi-objective shortest path problem ⋮ Efficient algorithms to find optimal paths in a public transportation network ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft ⋮ Auction algorithms for network flow problems: A tutorial introduction ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Dynamic programming approaches to solve the shortest path problem with forbidden paths ⋮ Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa ⋮ A bicriterion approach for routing problems in multimedia networks ⋮ Finding \(K\) shortest looping paths with waiting time in a time--window network ⋮ The shortest path problem with forbidden paths ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Finding the k Shortest Paths ⋮ DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS ⋮ On a special class of bicriterion path problems ⋮ An algorithm for the ranking of shortest paths
Cites Work
- 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
- Computational experience with an algorithm for finding the k shortest paths in a network
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- An Appraisal of Some Shortest-Path Algorithms
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An algorithm for ranking paths that may contain cycles
