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

DOI10.1007/BF01585517zbMATH Open0288.90080OpenAlexW1964416868MaRDI QIDQ4777084FDOQ4777084

Authors: 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

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

Cites Work

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

Cited In (27)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4777084)