Finding the Shortest Route between Two Points in a Network

Cited In (23)

A biobjective Dijkstra algorithm
A powerful force-based approach for the limit analysis of three-dimensional frames
A Forward-Backward Single-Source Shortest Paths Algorithm
The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
A parallel shortest path algorithm
Shortest-path algorithms: Taxonomy and annotation
MM: a bidirectional search algorithm that is guaranteed to meet in the middle
On the automation of the force method in the optimal plastic design of frames
A new bidirectional search algorithm with shortened postprocessing
Intelligent transportation systems -- Enabling technologies
Cutting and Packing Problems with Placement Constraints
Iterative Deepening Dynamically Improved Bounds Bidirectional Search
Shortest-path queries in static networks
A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs
\(BS^*:\) An admissible bidirectional staged heuristic search algorithm
Linear and semi-assignment problems: A core oriented approach
Efficient symbolic search for cost-optimal planning
Some new algorithms for location problems on networks
A procedure to determine intersections between polyhedral objects
Two new bidirectional search algorithms
A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
Heuristic shortest path algorithms for transportation applications: state of the art
Speeding up Martins' algorithm for multiple objective shortest path problems

This page was built for publication: Finding the Shortest Route between Two Points in a Network

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