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

classification schemeannotated bibliographyshortest-path algorithms

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 3298339 (Why is no real title available?)
• 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
• 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)

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

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)