Implementation and efficiency of Moore-algorithms for the shortest route problem
From MaRDI portal
Publication:4777084
DOI10.1007/BF01585517zbMath0288.90080MaRDI QIDQ4777084
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Routing with nonlinear multiattribute cost functions, 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, On the equivalence between some shortest path algorithms, Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm, Lagrangian relaxation and enumeration for solving constrained shortest-path problems, Devisenarbitrage als Flußprobleme
Cites Work
