Shortest path methods: A unifying approach
From MaRDI portal
Recommendations
Cited in
(78)- An extension of labeling techniques for finding shortest path trees
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
- Microcomputer-based algorithms for large scale shortest path problems
- An improvement of Dijkstra's method for finding a shortest path in a graph
- An efficient Dijkstra-like labeling method for computing shortest odd/even paths
- A note on the partitioning shortest path algorithm
- Program realization of shortest path algorithms in transportation MIS
- A parallel shortest path algorithm
- Computing shortest paths in networks derived from recurrence relations
- Shortest path algorithms: A computational study with the C programming language
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
- An algorithm for the ranking of shortest paths
- Paths with minimum range and ratio of arc lengths
- On the sum-max bicriterion path problem.
- Least possible time paths in stochastic, time-varying networks.
- Shortest path algorithms for functional environments
- Shortest path solvers. From software to wetware
- A branch-checking algorithm for all-pairs shortest paths
- Directed hypergraphs and applications
- Polynomial auction algorithms for shortest paths
- Intelligent transportation systems -- Enabling technologies
- Parallel asynchronous label-correcting methods for shortest paths
- Delay-constrained shortest paths: approximation algorithms and second-order cone models
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- Multicriteria adaptive paths in stochastic, time-varying networks
- Heuristic shortest path algorithms for transportation applications: state of the art
- On the equivalence between some shortest path algorithms
- Graph transformation approach for the shortest path search and length calculation
- Shortest-Path Reconstruction Algorithms
- Shortest path problem with multiple shortest paths
- Decomposition algorithms for finding the shortest path between a source node and a sink node of a network
- Shortest-path algorithms: Taxonomy and annotation
- scientific article; zbMATH DE number 3880462 (Why is no real title available?)
- Scatter search with path relinking for the job shop with time lags and setup times
- Solving the nearly symmetric all-pairs shortest-path problem
- Computing shortest paths with uncertainty
- Preconditioning linear least-squares problems by identifying a basis matrix
- Faster algorithms for the shortest path problem
- scientific article; zbMATH DE number 4158666 (Why is no real title available?)
- On the union of intermediate nodes of shortest paths
- A Class of Label-Correcting Methods for the K Shortest Paths Problem
- scientific article; zbMATH DE number 3902425 (Why is no real title available?)
- Shortest‐path methods: Complexity, interrelations and new propositions
- scientific article; zbMATH DE number 3937196 (Why is no real title available?)
- scientific article; zbMATH DE number 3952519 (Why is no real title available?)
- scientific article; zbMATH DE number 4066938 (Why is no real title available?)
- An Auction Algorithm for Shortest Paths
- scientific article; zbMATH DE number 1264418 (Why is no real title available?)
- A simple and fast label correcting algorithm for shortest paths
- A note on Bertsekas' small-label-first strategy
- Dual algorithms for the shortest path tree problem
- scientific article; zbMATH DE number 1145908 (Why is no real title available?)
- Implementation of efficient algorithms for globally optimal trajectories
- scientific article; zbMATH DE number 1488066 (Why is no real title available?)
- scientific article; zbMATH DE number 1528594 (Why is no real title available?)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- scientific article; zbMATH DE number 882129 (Why is no real title available?)
- scientific article; zbMATH DE number 936862 (Why is no real title available?)
- scientific article; zbMATH DE number 938615 (Why is no real title available?)
- Shortest path reoptimization vs resolution from scratch: a computational comparison
- Efficient Shortest Path Simplex Algorithms
- Deviation algorithms for ranking shortest paths
- Computing single source shortest paths using single-objective fitness
- An improvement of the Roy-Floyd algorithm
- On Some Special Network Flow Problems: The Shortest Path Tour Problems
- Heuristic estimates in shortest path algorithms
- Point-to-Point Shortest Path Algorithms with Preprocessing
- An Appraisal of Some Shortest-Path Algorithms
- Shortest path algorithms using dynamic breadth‐first search
- scientific article; zbMATH DE number 4185423 (Why is no real title available?)
- Shortest paths in almost acyclic graphs
- A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
- A block-parametric method for finding shortest paths in a graph
- A novel approach for modeling order picking paths
- Complexity analysis and optimization of the shortest path tour problem
- Optimizing the transport of organs for transplantation
- Two fast algorithms for all-pairs shortest paths
- Reconstructing shortest paths
This page was built for publication: Shortest path methods: A unifying approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3743140)
