Shortest-path algorithms: Taxonomy and annotation

DOI10.1002/NET.3230140208MaRDI QIDQ3330993zbMATH OpenOpenAlexFDO

Authors Narsingh Deo, Chiyin Pang

Publication date 1984

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230140208

zbMATH Keywords

annotated bibliographyclassification schemeshortest-path algorithms

Mathematics Subject Classification ID

Bibliographies for mathematics in general (00A15) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Shortest path methods: A unifying approach
• An Appraisal of Some Shortest-Path Algorithms
• scientific article; zbMATH DE number 3952519
• scientific article; zbMATH DE number 3937196
• scientific article; zbMATH DE number 1003284

Cites work

• A Method for the Solution of the N th Best Path Problem
• A Note on Dijkstra's Shortest Path Algorithm
• A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N -Node Nonnegative-Distance Networks
• A Shortest Path Algorithm for Edge-Sparse Graphs
• CalculatingKth Shortest Paths
• Computational experience with an algorithm for finding the k shortest paths in a network
• Determination of shortest path in a network with time-dependent edge-lengths¹
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½ N ³ Additions and
• Finding the Shortest Route between Two Points in a Network
• scientific article; zbMATH DE number 3298339 (Why is no real title available?)
• On the determination of the shortes path in a network having gains
• Some Computational Notes on the Shortest Route Problem
• Sparse matrix techniques for the shortest path problem

Cited in

(70)

• Microcomputer-based algorithms for large scale shortest path problems
• The hierarchical network design problem
• Transitive closure and related semiring properties via eliminants
• A parallel shortest path algorithm
• Parallel algorithms for the single source shortest path problem
• Weighted min cost flows
• An algorithm for finding the \(k\) quickest paths in a network
• Network reduction for the acyclic constrained shortest path problem
• The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
• On the quickest path problem
• An algorithm for the ranking of shortest paths
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Finding the \(k\) quickest simple paths in a network
• Dynamic expression trees
• A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
• Minimum time paths in a network with mixed time constraints.
• On the sum-max bicriterion path problem.
• A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
• Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
• Analysis of FPTASes for the multi-objective shortest path problem
• Shortest path algorithms for functional environments
• Shortest path solvers. From software to wetware
• Minimization of travel time and weighted number of stops in a traffic-light network
• Dynamic shortest path in stochastic dynamic networks: Ship routing problem
• Finding \(K\) shortest looping paths in a traffic-light network
• Intelligent transportation systems -- Enabling technologies
• Searching among intervals and compact routing tables
• Analyzing the reachability problem in choice networks
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• New algorithms for multi objective shortest path problem.
• Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
• The first K shortest unique-arc walks in a traffic-light network
• scientific article; zbMATH DE number 1003284 (Why is no real title available?)
• Symmetric connection problems and their solution by bidirectional search
• Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations
• Information tradeoffs in model building: A network routing application
• Approximating the Stochastic Network by its M Shortest Paths
• UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
• scientific article; zbMATH DE number 3952519 (Why is no real title available?)
• Shortest path methods: A unifying approach
• The determination of the path with minimum-cost norm value
• Efficient modeling of travel in networks with time-varying link speeds
• scientific article; zbMATH DE number 1542607 (Why is no real title available?)
• scientific article; zbMATH DE number 1783874 (Why is no real title available?)
• Searching among intervals and compact routing tables
• New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
• scientific article; zbMATH DE number 3795354 (Why is no real title available?)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• Dynamic programming approaches to solve the shortest path problem with forbidden paths
• A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network
• An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
• Distributed shortest-path protocols for time-dependent networks
• Shortest-path queries in static networks
• Shortest path algorithms
• On Some Special Network Flow Problems: The Shortest Path Tour Problems
• Solving the constrained shortest path problem using random search strategy
• An Appraisal of Some Shortest-Path Algorithms
• Graph theory (algorithmic, algebraic, and metric problems)
• A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
• Upgrading edges in the graphical TSP
• Reachability in choice networks
• Lower bounds for non-adaptive shortest path relaxation
• Complexity analysis and optimization of the shortest path tour problem
• Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications
• Lower bounds for adaptive relaxation-based algorithms for single-source shortest paths
• A parametric approach to solving bicriterion shortest path problems
• Location of central nodes in time varying computer networks
• The quickest path problem
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• Optimal paths in bi-attribute networks with fractional cost functions

This page was built for publication: Shortest-path algorithms: Taxonomy and annotation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3330993)