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