An Appraisal of Some Shortest-Path Algorithms
From MaRDI portal
Publication:5558804
DOI10.1287/opre.17.3.395zbMath0172.44202MaRDI 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
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
Unnamed Item, Dynamic shortest paths minimizing travel times and costs, On a negative-equivalency theorem in associative optimal path problems, Implementation and efficiency of Moore-algorithms for the shortest route 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, Computational experience with a group theoretic integer programming algorithm, A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem, Routing with nonlinear multiattribute cost functions, Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications, An algorithm for ranking paths that may contain cycles, Shortest paths in networks with vector weights, Shortest paths without a map, Routing of a hazmat truck in the presence of weather systems, Optimal routing for maximizing the travel time reliability, Finding shortest path in the presence of barriers: an alternate approach, A survey of dynamic network flows, An algorithm for ranking paths in acyclic networks, A dynamic programming algorithm to find all solutions in a neighborhood of the optimum, The fleet size and mix vehicle routing problem, 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, Accurate calculation of hazardous materials transport risks., Solving some lexicographic multi-objective combinatorial problems, 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, Intelligent transportation systems -- Enabling technologies, 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, 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, Shortest and longest path problems, Simultaneous computation of functions, partial derivatives and estimates of rounding errors —Complexity and practicality—, An algorithm for then×n optimum assignment problem, On shortest-path algorithms in the topological design of computer networks: a comparative study, Parallel Algorithms for Network Routing Problems and Recurrences, Personnel assignment by multiobjective programming, Shortest route with time dependent length of edges and limited delay possibilities in nodes, Some optimal path problems subject to improvements, Finding the k Shortest Paths
