Implementation and efficiency of Moore-algorithms for the shortest route problem

DOI10.1007/BF01585517zbMath0288.90080OpenAlexW1964416868MaRDI QIDQ4777084

U. Pape

Publication date: 1974

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585517

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items (27)

A heuristic improvement of the Bellman-Ford algorithm ⋮ Robust vehicle routing DSS and road networks on a European scale? ⋮ A note on the partitioning shortest path algorithm ⋮ On the equivalence between some shortest path algorithms ⋮ Parallel asynchronous label-correcting methods for shortest paths ⋮ Shortest paths algorithms: Theory and experimental evaluation ⋮ Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs ⋮ Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location ⋮ Least possible time paths in stochastic, time-varying networks. ⋮ An efficient label setting/correcting shortest path algorithm ⋮ Devisenarbitrage als Flußprobleme ⋮ A new algorithm to find the shortest paths between all pairs of nodes ⋮ Lagrangian relaxation and enumeration for solving constrained shortest-path problems ⋮ A new approximation algorithm for obtaining the probability distribution function for project completion time ⋮ Shortest path algorithms: A computational study with the C programming language ⋮ Routing with nonlinear multiattribute cost functions ⋮ Shortest-path queries in static networks ⋮ On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ Heuristic shortest path algorithms for transportation applications: state of the art ⋮ An evaluation of mathematical programming and minicomputers ⋮ Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge ⋮ Solving the Nearly Symmetric All-Pairs Shortest-Path Problem ⋮ An extension of labeling techniques for finding shortest path trees ⋮ An empirical investigation of some bicriterion shortest path algorithms ⋮ Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm ⋮ Microcomputer-based algorithms for large scale shortest path problems

Cites Work

• Solutions of the Shortest-Route Problem—A Review
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: Implementation and efficiency of Moore-algorithms for the shortest route problem