Finding the Shortest Route between Two Points in a Network
From MaRDI portal
Publication:5535992
DOI10.1093/comjnl/9.3.275zbMath0156.18107OpenAlexW1965469937MaRDI QIDQ5535992
Publication date: 1966
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/9.3.275
Related Items (23)
Intelligent transportation systems -- Enabling technologies ⋮ Efficient symbolic search for cost-optimal planning ⋮ A parallel shortest path algorithm ⋮ \(BS^*:\) An admissible bidirectional staged heuristic search algorithm ⋮ On the automation of the force method in the optimal plastic design of frames ⋮ Iterative Deepening Dynamically Improved Bounds Bidirectional Search ⋮ MM: a bidirectional search algorithm that is guaranteed to meet in the middle ⋮ A powerful force-based approach for the limit analysis of three-dimensional frames ⋮ A procedure to determine intersections between polyhedral objects ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs ⋮ A biobjective Dijkstra algorithm ⋮ Cutting and Packing Problems with Placement Constraints ⋮ Two new bidirectional search algorithms ⋮ Shortest-path algorithms: Taxonomy and annotation ⋮ Shortest-path queries in static networks ⋮ Heuristic shortest path algorithms for transportation applications: state of the art ⋮ The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm ⋮ A new bidirectional search algorithm with shortened postprocessing ⋮ Some new algorithms for location problems on networks ⋮ Linear and semi-assignment problems: A core oriented approach ⋮ A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths ⋮ A Forward-Backward Single-Source Shortest Paths Algorithm
This page was built for publication: Finding the Shortest Route between Two Points in a Network
