Shortest-path algorithms: Taxonomy and annotation
From MaRDI portal
Publication:3330993
DOI10.1002/NET.3230140208zbMATH Open0542.90101OpenAlexW2063317962MaRDI QIDQ3330993FDOQ3330993
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
Recommendations
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)
Cites Work
- Efficient Algorithms for Shortest Paths in Sparse Networks
- A Method for the Solution of the N th Best Path Problem
- Title not available (Why is that?)
- Computational experience with an algorithm for finding the k shortest paths in a network
- Finding the Shortest Route between Two Points in a Network
- A Note on Dijkstra's Shortest Path Algorithm
- A Shortest Path Algorithm for Edge-Sparse Graphs
- Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½ N 3 Additions and N 3 Comparisons
- CalculatingKth Shortest Paths
- Sparse matrix techniques for the shortest path problem
- A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N -Node Nonnegative-Distance Networks
- On the determination of the shortes path in a network having gains
- Some Computational Notes on the Shortest Route Problem
- Determination of shortest path in a network with time-dependent edge-lengths1
Cited In (69)
- Reachability in choice networks
- Upgrading edges in the graphical TSP
- Lower bounds for non-adaptive shortest path relaxation
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
- On Some Special Network Flow Problems: The Shortest Path Tour Problems
- Title not available (Why is that?)
- 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
- A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
- Minimization of travel time and weighted number of stops in a traffic-light network
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
- Solving the constrained shortest path problem using random search strategy
- Title not available (Why is that?)
- A parallel shortest path algorithm
- 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.
- Distributed shortest-path protocols for time-dependent networks
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
- Shortest path algorithms for functional environments
- Shortest path solvers. From software to wetware
- Title not available (Why is that?)
- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
- Shortest path methods: A unifying approach
- UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH 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
- Graph theory (algorithmic, algebraic, and metric problems)
- Efficient modeling of travel in networks with time-varying link speeds
- Dynamic programming approaches to solve the shortest path problem with forbidden paths
- Intelligent transportation systems -- Enabling technologies
- Symmetric connection problems and their solution by bidirectional search
- The first \(K\) shortest unique-arc walks in a traffic-light network
- Searching among intervals and compact routing tables
- Parallel algorithms for the single source shortest path problem
- The quickest path problem
- Analysis of FPTASes for the multi-objective shortest path problem
- The determination of the path with minimum-cost norm value
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- The hierarchical network design problem
- Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations
- 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.
- Shortest-path queries in static networks
- Weighted min cost flows
- Analyzing the reachability problem in choice networks
- Title not available (Why is that?)
- Information tradeoffs in model building: A network routing application
- A parametric approach to solving bicriterion shortest path problems
- Searching among intervals and compact routing tables
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- Complexity analysis and optimization of the shortest path tour problem
- Dynamic expression trees
- 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
- Title not available (Why is that?)
- Finding \(K\) shortest looping paths in a traffic-light network
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Microcomputer-based algorithms for large scale shortest path problems
- Location of central nodes in time varying computer networks
- Transitive closure and related semiring properties via eliminants
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)
