An Appraisal of Some Shortest-Path Algorithms
From MaRDI portal
Publication:5558804
DOI10.1287/OPRE.17.3.395zbMATH Open0172.44202OpenAlexW2144050074MaRDI QIDQ5558804FDOQ5558804
Authors: Stuart E. Dreyfus 
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.3.395
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cited In (only showing first 100 items - show all)
- Routing algorithms with range restriction in sparse supply networks
- A computational study of efficient shortest path algorithms
- Shortest path problem with multiple shortest paths
- Parallel Algorithms for Network Routing Problems and Recurrences
- The DT-polynomial approach to discrete time-varying network flow problems
- Program realization of shortest path algorithms in transportation MIS
- Shortest and longest path problems
- A computational improvement for a shortest paths ranking algorithm
- A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
- Title not available (Why is that?)
- A parallel shortest path algorithm
- Title not available (Why is that?)
- A note on a single-shift days-off scheduling problem with sequence-dependent labor costs
- On computing Pareto optimal paths in weighted time-dependent networks
- A generalized permanent label setting algorithm for the shortest path between specified nodes
- Continuous-time shortest path problems with stopping and starting costs
- Title not available (Why is that?)
- Computing the nxm shortest path efficiently
- Shortest path algorithms for functional environments
- A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
- Solvable classes of discrete dynamic programming
- Note on ``A new bidirectional algorithm for shortest paths
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
- A new bidirectional search algorithm with shortened postprocessing
- An algorithm for then×n optimum assignment problem
- Finding shortest path in the presence of barriers: an alternate approach
- Efficiently listing bounded length \(st\)-paths
- Shortest route with time dependent length of edges and limited delay possibilities in nodes
- The first \(K\) shortest unique-arc walks in a traffic-light network
- Heuristic estimates in shortest path algorithms
- Shortest path algorithms using dynamic breadth‐first search
- A new algorithm to find the shortest paths between all pairs of nodes
- On the connectivity of a network
- Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
- A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs
- \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
- An intelligent search path
- Periodicity and critical circuits in a generalized max-algebra setting
- A generic auction algorithm for the minimum cost network flow problem
- Flows with unit path capacities and related packing and covering problems
- On the equivalence between some shortest path algorithms
- Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach
- An algorithm for ranking paths in acyclic networks
- Core routing on dynamic time-dependent road networks
- All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
- An improvement of Dijkstra's method for finding a shortest path in a graph
- An O(m log D) algorithm for shortest paths
- Title not available (Why is that?)
- Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
- Microcomputer-based algorithms for large scale shortest path problems
- On the time required to detect cycles and connectivity in graphs
- An evaluation of mathematical programming and minicomputers
- Travelling time on dense networks
- A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
- Dijkstra's shortest-path algorithm in a network with variable weight matrices
- Heuristically guided search and chromosome matching
- Shortest paths in stochastic networks with correlated link costs
- Space-efficient, fast and exact routing in time-dependent road networks
- Routing with nonlinear multiattribute cost functions
- Dynamic shortest paths minimizing travel times and costs
- Arriving on time
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Energy-optimal routes for battery electric vehicles
- Computational experience with a group theoretic integer programming algorithm
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- Development and implementation of algorithms for vehicle routing during a no-notice evacuation
- Shortest paths in piecewise continuous time-dependent networks
- Shortest-path algorithms: Taxonomy and annotation
- Finding the shortest path in stochastic networks
- Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications
- A GRASP and path relinking heuristic for rural road network development
- Robust shortest path planning and semicontractive dynamic programming
- Optimal routing for maximizing the travel time reliability
- Models and algorithm for stochastic shortest path problem
- Personnel assignment by multiobjective programming
- New algorithms for multi objective shortest path problem.
- Bidirectional A ∗ Search for Time-Dependent Fast Paths
- Distributed shortest-path protocols for time-dependent networks
- Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
- Auction algorithms for network flow problems: A tutorial introduction
- Routing of a hazmat truck in the presence of weather systems
- Title not available (Why is that?)
- Shortest path methods: A unifying approach
- Identification of probabilistic approaches and map-based navigation in motion planning for mobile robots
- Shortest paths without a map
- A shortest path routing problem with resource allocation
- On the complexity of time-dependent shortest paths
- A bidirectional shortest-path algorithm with good average-case behavior
- Efficient modeling of travel in networks with time-varying link speeds
- Shortest path problem with uncertain arc lengths
- A weakly coupled model of differential equations for thief tracking
- On the complexity of testing a graph for n-cube
- Bicriteria shortest path in networks of queues
- A dynamic programming solution of a shortest path problem with time constraints on movement and parking
- New formulations for the elementary shortest-path problem visiting a given set of nodes
- Data-driven approaches for emissions-minimized paths in urban areas
- An algorithm for finding the \(k\) quickest paths in a network
- An algorithm for the ranking of shortest paths
- Solving k-shortest and constrained shortest path problems efficiently
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)
