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)
- 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
- Deviation algorithms for ranking shortest paths
- AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS
- A polynomial-time algorithm to find shortest paths with recourse
- Heuristic search viewed as path finding in a graph
- Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation
- Shortest-path queries in static networks
- Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs
- Simultaneous computation of functions, partial derivatives and estimates of rounding errors —Complexity and practicality—
- Dynamic shortest path problems with time-varying costs
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
- An algorithm to assign pedestrian groups dispersing at public gatherings based on pedestrian-traffic modelling
- Vehicle dispatching with time-dependent travel times
- Finding the k Shortest Paths
- The fleet size and mix vehicle routing problem
- Routing through a network with maximum reliability
- A survey of dynamic network flows
- The time-dependent shortest path and vehicle routing problem
- Weighting factor extensions for finite multiple objective vector minimization problems
- Shortest‐path methods: Complexity, interrelations and new propositions
- Accurate calculation of hazardous materials transport risks.
- Algorithms for time-dependent bicriteria shortest path problems
- Shortest paths in networks with vector weights
- Bidirectional \(A^*\) search on time-dependent road networks
- A two-criterion lexicographic algorithm for finding all shortest paths in networks
- Heuristic shortest path algorithms for transportation applications: state of the art
- New models for shortest path problem with fuzzy arc lengths
- Uncertain random shortest path problem
- Finding \(K\) shortest looping paths in a traffic-light network
- Shortest paths on dynamic graphs
- On the optimality of algorithms for finite state sequential decision processes
- Implementation and efficiency of Moore-algorithms for the shortest route problem
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Title not available (Why is that?)
- Multicriteria adaptive paths in stochastic, time-varying networks
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- An algorithm for ranking paths that may contain cycles
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- Solving some lexicographic multi-objective combinatorial problems
- Optimising waiting at nodes in time-dependent networks: cost functions and applications
- 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
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)
