Implementation and efficiency of Moore-algorithms for the shortestroute problem
From MaRDI portal
Cites work
Cited in
(28)- An extension of labeling techniques for finding shortest path trees
- Microcomputer-based algorithms for large scale shortest path problems
- A note on the partitioning shortest path algorithm
- A new algorithm to find the shortest paths between all pairs of nodes
- Shortest path algorithms: A computational study with the C programming language
- An evaluation of mathematical programming and minicomputers
- Least possible time paths in stochastic, time-varying networks.
- An empirical investigation of some bicriterion shortest path algorithms
- Robust vehicle routing DSS and road networks on a European scale?
- Parallel asynchronous label-correcting methods for shortest paths
- Shortest paths algorithms: Theory and experimental evaluation
- A heuristic improvement of the Bellman-Ford algorithm
- A new approximation algorithm for obtaining the probability distribution function for project completion time
- 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
- Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
- On the equivalence between some shortest path algorithms
- Solving the nearly symmetric all-pairs shortest-path problem
- Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
- Devisenarbitrage als Flußprobleme
- An efficient label setting/correcting shortest path algorithm
- Shortest-path queries in static networks
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
- Routing with nonlinear multiattribute cost functions
- An efficient alternative strategy for finding prices in envy-free perfect matchings
This page was built for publication: Implementation and efficiency of Moore-algorithms for the shortestroute problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4777084)