An Appraisal of Some Shortest-Path Algorithms
From MaRDI portal
Publication:5558804
DOI10.1287/opre.17.3.395zbMath0172.44202OpenAlexW2144050074MaRDI QIDQ5558804
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
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
A computational improvement for a shortest paths ranking algorithm, Periodicity and critical circuits in a generalized max-algebra setting, Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering, Bidirectional A* search on time-dependent road networks, The fleet size and mix vehicle routing problem, Parameter-free sampled fictitious play for solving deterministic dynamic programming problems, Distance oracles for time-dependent networks, Finding \(K\) shortest looping paths in a traffic-light network, Dynamic shortest path problems with time-varying costs, A weakly coupled model of differential equations for thief tracking, New formulations for the elementary shortest-path problem visiting a given set of nodes, Shortest paths in stochastic networks with correlated link costs, Uncertain programming models for multi-objective shortest path problem with uncertain parameters, Routing of a hazmat truck in the presence of weather systems, Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs, Weighting factor extensions for finite multiple objective vector minimization problems, Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach, Data-driven approaches for emissions-minimized paths in urban areas, Intelligent transportation systems -- Enabling technologies, Optimal routing for maximizing the travel time reliability, A parallel shortest path algorithm, A computational study of efficient shortest path algorithms, \(BS^*:\) An admissible bidirectional staged heuristic search algorithm, On computing Pareto optimal paths in weighted time-dependent networks, Finding shortest path in the presence of barriers: an alternate approach, A generalization of Bellman's equation with application to path planning, obstacle avoidance and invariant set estimation, Efficiently Listing Bounded Length st-Paths, Bidirectional A ∗ Search for Time-Dependent Fast Paths, An O(m log D) algorithm for shortest paths, On the complexity of testing a graph for n-cube, Optimising waiting at nodes in time-dependent networks: cost functions and applications, Accurate calculation of hazardous materials transport risks., 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, A survey of dynamic network flows, Routing through a network with maximum reliability, New models for shortest path problem with fuzzy arc lengths, A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs, On the complexity of time-dependent shortest paths, Shortest path problem with uncertain arc lengths, Finding the shortest path in stochastic networks, Algorithms for time-dependent bicriteria shortest path problems, 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, Routing with nonlinear multiattribute cost functions, New algorithms for multi objective shortest path problem., An algorithm for finding the \(k\) quickest paths in a network, Auction algorithms for network flow problems: A tutorial introduction, Exact approaches for integrated aircraft fleeting and routing at TunisAir, The first \(K\) shortest unique-arc walks in a traffic-light network, Multicriteria adaptive paths in stochastic, time-varying networks, Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications, Fast paths in large-scale dynamic road networks, On the optimality of algorithms for finite state sequential decision processes, Heuristic shortest path algorithms for transportation applications: state of the art, Arriving on time, Shortest and longest path problems, Travelling time on dense networks, Finding \(K\) shortest looping paths with waiting time in a time--window network, Identification of probabilistic approaches and map-based navigation in motion planning for mobile robots, The multiple shortest path problem with path deconfliction, The DT-polynomial approach to discrete time-varying network flow problems, An intelligent search path, An evaluation of mathematical programming and minicomputers, Shortest paths in piecewise continuous time-dependent networks, An algorithm to assign pedestrian groups dispersing at public gatherings based on pedestrian-traffic modelling, Efficient Computation of Time-Dependent Centralities in Air Transportation Networks, The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm, Core Routing on Dynamic Time-Dependent Road Networks, Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation, Energy-optimal routes for battery electric vehicles, Heuristically guided search and chromosome matching, Heuristic search viewed as path finding in a graph, An algorithm for ranking paths that may contain cycles, A new bidirectional search algorithm with shortened postprocessing, 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, Flows with unit path capacities and related packing and covering problems, Solvable classes of discrete dynamic programming, Uncertain random shortest path problem, Shortest path with acceleration constraints: complexity and approximation algorithms, Robust shortest path planning and semicontractive dynamic programming, Paths and trails in edge-colored weighted graphs, An algorithm for ranking paths in acyclic networks, Models and algorithm for stochastic shortest path problem, A GRASP and path relinking heuristic for rural road network development, NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times, Shortest paths in networks with vector weights, Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem, An algorithm for the ranking of shortest paths, Solving some lexicographic multi-objective combinatorial problems, A generic auction algorithm for the minimum cost network flow problem, Shortest paths without a map, A dynamic programming algorithm to find all solutions in a neighborhood of the optimum, Vehicle dispatching with time-dependent travel times, Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks, Reliability in public transit networks considering backup itineraries, An axiomatic approach to time-dependent shortest path oracles, The time-dependent shortest path and vehicle routing problem, A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set, A decomposable transshipment algorithm for a multiperiod transportation problem, Some problems in discrete optimization, Some constrained shortest-route problems, On the time required to detect cycles and connectivity in graphs, The impact of time aggregation and travel time models on time-dependent routing solutions, A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits, Simultaneous computation of functions, partial derivatives and estimates of rounding errors —Complexity and practicality—, A note on a single-shift days-off scheduling problem with sequence-dependent labor costs, On using dynamic programming for time warping in pattern recognition, Computational experience with a group theoretic integer programming algorithm, Distributed shortest-path protocols for time-dependent networks, Space-efficient, fast and exact routing in time-dependent road networks, Personnel assignment by multiobjective programming, A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem, Shortest-path queries in static networks, Shortest route with time dependent length of edges and limited delay possibilities in nodes, Efficient modeling of travel in networks with time-varying link speeds, Dynamic shortest paths minimizing travel times and costs, Some optimal path problems subject to improvements, On the shortest path problem with negative cost cycles, An algorithm for then×n optimum assignment problem, Development and implementation of algorithms for vehicle routing during a no-notice evacuation, Shortest paths on dynamic graphs, On shortest-path algorithms in the topological design of computer networks: a comparative study, Finding the k Shortest Paths, DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS, Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks, On a negative-equivalency theorem in associative optimal path problems, Parallel Algorithms for Network Routing Problems and Recurrences, Implementation and efficiency of Moore-algorithms for the shortest route problem
