An algorithm for ranking paths that may contain cycles

DOI10.1016/0377-2217(84)90269-8MaRDI QIDQ759658zbMATHOpenAlexFDO

Authors 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

zbMATH Keywords

algorithmcyclesdirected networkComputational resultsbest pathsshortest paths problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

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

Cites work

• scientific article; zbMATH DE number 3965788 (Why is no real title available?)
• scientific article; zbMATH DE number 3726107 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• An Appraisal of Some Shortest-Path Algorithms
• Computational experience with an algorithm for finding the k shortest paths in a network
• On algorithms for finding the k shortest paths in a network
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

Cited in

(23)

• A new implementation of Yen's ranking loopless paths algorithm
• Finding \(K\) shortest looping paths in a traffic-light network
• Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft
• An algorithm for the ranking of shortest paths
• Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa
• Efficient algorithms to find optimal paths in a public transportation network
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Auction algorithms for network flow problems: A tutorial introduction
• The Steiner bi-objective shortest path problem
• Finding \(K\) shortest looping paths with waiting time in a time--window network
• Dynamic programming approaches to solve the shortest path problem with forbidden paths
• Multiobjective routing problems
• Speeding up Martins' algorithm for multiple objective shortest path problems
• The shortest path problem with forbidden paths
• A survey of resource constrained shortest path problems: exact solution approaches
• Finding the k Shortest Paths
• On a special class of bicriterion path problems
• Deviation algorithms for ranking shortest paths
• Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations
• 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
• A bicriterion approach for routing problems in multimedia networks
• Shortest paths avoiding forbidden subpaths

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)