An algorithm for ranking paths that may contain cycles
From MaRDI portal
Publication:759658
DOI10.1016/0377-2217(84)90269-8zbMATH Open0553.90099OpenAlexW2027442194MaRDI QIDQ759658FDOQ759658
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
Recommendations
- An algorithm for the ranking of shortest paths
- An efficient time and space \(K\) point-to-point shortest simple paths algorithm
- Ranking One Million Simple Paths in Road Networks
- Deviation algorithms for ranking shortest paths
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)
Cites Work
- Title not available (Why is that?)
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- An Appraisal of Some Shortest-Path Algorithms
- Title not available (Why is that?)
- Computational experience with an algorithm for finding the k shortest paths in a network
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- Title not available (Why is that?)
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- On algorithms for finding the k shortest paths in a network
Cited In (23)
- Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa
- Shortest paths avoiding forbidden subpaths
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- A bicriterion approach for routing problems in multimedia networks
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
- Auction algorithms for network flow problems: A tutorial introduction
- Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft
- Dynamic programming approaches to solve the shortest path problem with forbidden paths
- A new implementation of Yen's ranking loopless paths algorithm
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- An algorithm for the ranking of shortest paths
- On a special class of bicriterion path problems
- Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs
- Multiobjective routing problems
- The shortest path problem with forbidden paths
- Efficient algorithms to find optimal paths in a public transportation network
- Finding the k Shortest Paths
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations
- The Steiner bi-objective shortest path problem
- A survey of resource constrained shortest path problems: exact solution approaches
- Finding \(K\) shortest looping paths in a traffic-light network
- Speeding up Martins' algorithm for multiple objective shortest path problems
This page was built for publication: An algorithm for ranking paths that may contain cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759658)
