An Appraisal of Some Shortest-Path Algorithms
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A new bidirectional search algorithm with shortened postprocessing
- Flows with unit path capacities and related packing and covering problems
- An algorithm for ranking paths in acyclic networks
- Microcomputer-based algorithms for large scale shortest path problems
- A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
- An improvement of Dijkstra's method for finding a shortest path in a graph
- The fleet size and mix vehicle routing problem
- Program realization of shortest path algorithms in transportation MIS
- Weighting factor extensions for finite multiple objective vector minimization problems
- A parallel shortest path algorithm
- A computational study of efficient shortest path algorithms
- \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
- An O(m log D) algorithm for shortest paths
- On the complexity of testing a graph for n-cube
- A new algorithm to find the shortest paths between all pairs of nodes
- On the connectivity of a network
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
- Routing through a network with maximum reliability
- A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs
- A dynamic programming solution of a shortest path problem with time constraints on movement and parking
- Continuous-time shortest path problems with stopping and starting costs
- An algorithm for finding the \(k\) quickest paths in a network
- Auction algorithms for network flow problems: A tutorial introduction
- On the optimality of algorithms for finite state sequential decision processes
- Travelling time on dense networks
- The DT-polynomial approach to discrete time-varying network flow problems
- An evaluation of mathematical programming and minicomputers
- An algorithm to assign pedestrian groups dispersing at public gatherings based on pedestrian-traffic modelling
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
- An algorithm for the ranking of shortest paths
- A generic auction algorithm for the minimum cost network flow problem
- A computational improvement for a shortest paths ranking algorithm
- Periodicity and critical circuits in a generalized max-algebra setting
- A two-phase shortest path algorithm for networks with node coordinates
- Accurate calculation of hazardous materials transport risks.
- Solving some lexicographic multi-objective combinatorial problems
- A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
- Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach
- Shortest path algorithms for functional environments
- A bidirectional shortest-path algorithm with good average-case behavior
- Vehicle dispatching with time-dependent travel times
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- Finding \(K\) shortest looping paths in a traffic-light network
- Efficient algorithms for some path partitioning problems
- Intelligent transportation systems -- Enabling technologies
- Optimising waiting at nodes in time-dependent networks: cost functions and applications
- Construction of simple path graphs in transport networks. I: General solutions and examples
- The multiple shortest path problem with path deconfliction
- Shortest path with acceleration constraints: complexity and approximation algorithms
- NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times
- Reliability in public transit networks considering backup itineraries
- An axiomatic approach to time-dependent shortest path oracles
- Uncertain programming models for multi-objective shortest path problem with uncertain parameters
- A two-criterion lexicographic algorithm for finding all shortest paths in networks
- Fast paths in large-scale dynamic road networks
- Energy-optimal routes for battery electric vehicles
- Paths and trails in edge-colored weighted graphs
- Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
- Shortest paths in stochastic networks with correlated link costs
- Finding the shortest path in stochastic networks
- Algorithms for time-dependent bicriteria shortest path problems
- New algorithms for multi objective shortest path problem.
- The first K shortest unique-arc walks in a traffic-light network
- Multicriteria adaptive paths in stochastic, time-varying networks
- Heuristic shortest path algorithms for transportation applications: state of the art
- Arriving on time
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Shortest paths in piecewise continuous time-dependent networks
- Heuristically guided search and chromosome matching
- Heuristic search viewed as path finding in a graph
- A generalized permanent label setting algorithm for the shortest path between specified nodes
- All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
- Solvable classes of discrete dynamic programming
- Models and algorithm for stochastic shortest path problem
- A GRASP and path relinking heuristic for rural road network development
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- On the equivalence between some shortest path algorithms
- On computing Pareto optimal paths in weighted time-dependent networks
- A generalization of Bellman's equation with application to path planning, obstacle avoidance and invariant set estimation
- Shortest and longest path problems
- Core routing on dynamic time-dependent road networks
- Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation
- Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
- Bidirectional A^* search on time-dependent road networks
- Efficiently listing bounded length \(st\)-paths
- An intelligent search path
- Efficient computation of time-dependent centralities in air transportation networks
- Robust shortest path planning and semicontractive dynamic programming
- scientific article; zbMATH DE number 1003284 (Why is no real title available?)
- scientific article; zbMATH DE number 1810501 (Why is no real title available?)
- A weakly coupled model of differential equations for thief tracking
- Shortest path problem with multiple shortest paths
- New formulations for the elementary shortest-path problem visiting a given set of nodes
- PRACTICAL EFFICIENCIES OF EXISTING SHORTEST-PATH ALGORITHMS AND A NEW BUCKET ALGORITHM
- 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?)
- scientific article; zbMATH DE number 4202051 (Why is no real title available?)
- Dijkstra's shortest-path algorithm in a network with variable weight matrices
This page was built for publication: An Appraisal of Some Shortest-Path Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5558804)
