Finding the Shortest Route between Two Points in a Network
From MaRDI portal
Publication:5535992
Cited in
(23)- A new bidirectional search algorithm with shortened postprocessing
- Shortest-path algorithms: Taxonomy and annotation
- Efficient symbolic search for cost-optimal planning
- Cutting and packing problems with placement constraints
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
- Heuristic shortest path algorithms for transportation applications: state of the art
- A biobjective Dijkstra algorithm
- Speeding up Martins' algorithm for multiple objective shortest path problems
- A powerful force-based approach for the limit analysis of three-dimensional frames
- Shortest-path queries in static networks
- Some new algorithms for location problems on networks
- A forward-backward single-source shortest paths algorithm
- A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs
- A procedure to determine intersections between polyhedral objects
- MM: a bidirectional search algorithm that is guaranteed to meet in the middle
- Intelligent transportation systems -- Enabling technologies
- Two new bidirectional search algorithms
- A parallel shortest path algorithm
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Linear and semi-assignment problems: A core oriented approach
- Iterative Deepening Dynamically Improved Bounds Bidirectional Search
- On the automation of the force method in the optimal plastic design of frames
- \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
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)
