Finding the Shortest Route between Two Points in a Network
From MaRDI portal
Publication:5535992
DOI10.1093/comjnl/9.3.275zbMath0156.18107MaRDI 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
A parallel shortest path algorithm, \(BS^*:\) An admissible bidirectional staged heuristic search algorithm, A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs, The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm, Some new algorithms for location problems on networks, On the automation of the force method in the optimal plastic design of frames, A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths, Intelligent transportation systems -- Enabling technologies, Heuristic shortest path algorithms for transportation applications: state of the art, Linear and semi-assignment problems: A core oriented approach, Shortest-path algorithms: Taxonomy and annotation, A procedure to determine intersections between polyhedral objects