A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
From MaRDI portal
Publication:3049827
DOI10.1002/net.3230090304zbMath0414.68035OpenAlexW2061159212MaRDI QIDQ3049827
No author found.
Publication date: 1979
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230090304
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)
Related Items (40)
Experimentation in optimization ⋮ Shortest path reoptimization vs resolution from scratch: a computational comparison ⋮ New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels ⋮ Robust vehicle routing DSS and road networks on a European scale? ⋮ A note on the partitioning shortest path algorithm ⋮ Intelligent transportation systems -- Enabling technologies ⋮ A computational study of efficient shortest path algorithms ⋮ The theory and practice of distance geometry ⋮ Layering strategies for creating exploitable structure in linear and integer programs ⋮ A polynomial time primal network simplex algorithm for minimum cost flows ⋮ Shortest paths algorithms: Theory and experimental evaluation ⋮ Multiobjective routing problems ⋮ Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks ⋮ Implementation and analysis of a variant of the dual method for the capacitated transshipment problem ⋮ A new algorithm to find the shortest paths between all pairs of nodes ⋮ The basis suppression method ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ A bicriterion shortest path algorithm ⋮ Computing inter-site distances for routing and scheduling problems ⋮ Shortest path algorithms: A computational study with the C programming language ⋮ Polynomial-time primal simplex algorithms for the minimum cost network flow problem ⋮ Polynomial dual network simplex algorithms ⋮ Shortest-path queries in static networks ⋮ Efficient modeling of travel in networks with time-varying link speeds ⋮ An evaluation of mathematical programming and minicomputers ⋮ SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY ⋮ Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation ⋮ The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm ⋮ An algorithm for ranking paths that may contain cycles ⋮ An extension of labeling techniques for finding shortest path trees ⋮ An empirical investigation of some bicriterion shortest path algorithms ⋮ Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function ⋮ DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS ⋮ The Bounded Path Tree Problem ⋮ An algorithm for the ranking of shortest paths ⋮ An interactive procedure using domination cones for bicriterion shortest path problems ⋮ The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm ⋮ A parametric approach to solving bicriterion shortest path problems ⋮ Microcomputer-based algorithms for large scale shortest path problems ⋮ The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
Cites Work
This page was built for publication: A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
