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

From MaRDI portal
Publication:4777084

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




Related Items (27)

A heuristic improvement of the Bellman-Ford algorithmRobust vehicle routing DSS and road networks on a European scale?A note on the partitioning shortest path algorithmOn the equivalence between some shortest path algorithmsParallel asynchronous label-correcting methods for shortest pathsShortest paths algorithms: Theory and experimental evaluationFast shortest-paths algorithms in the presence of few destinations of negative-weight arcsAdaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery locationLeast possible time paths in stochastic, time-varying networks.An efficient label setting/correcting shortest path algorithmDevisenarbitrage als FlußproblemeA new algorithm to find the shortest paths between all pairs of nodesLagrangian relaxation and enumeration for solving constrained shortest-path problemsA new approximation algorithm for obtaining the probability distribution function for project completion timeShortest path algorithms: A computational study with the C programming languageRouting with nonlinear multiattribute cost functionsShortest-path queries in static networksOn contrasting vertex contraction with relaxation-based approaches for negative cost cycle detectionMulticriteria adaptive paths in stochastic, time-varying networksHeuristic shortest path algorithms for transportation applications: state of the artAn evaluation of mathematical programming and minicomputersFinding a minimum cost path between a pair of nodes in a time-varying road network with a congestion chargeSolving the Nearly Symmetric All-Pairs Shortest-Path ProblemAn extension of labeling techniques for finding shortest path treesAn empirical investigation of some bicriterion shortest path algorithmsTwo-Levels-Greedy: a generalization of Dijkstra's shortest path algorithmMicrocomputer-based algorithms for large scale shortest path problems



Cites Work


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