Shortest paths with euclidean distances: An explanatory model

DOI10.1002/net.3230080404zbMath0394.94040OpenAlexW2154672625MaRDI QIDQ4177493

Michael O. Ball, Bruce L. Golden

Publication date: 1978

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230080404

zbMATH Keywords

AlgorithmNetwork ProgrammingFlows in NetworksShortest PathEuclidean Distance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Circuits, networks (94C99) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Software, source code, etc. for problems pertaining to combinatorics (05-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items (5)

Bidirectional A* search on time-dependent road networks ⋮ Shortest paths in Euclidean graphs ⋮ Solving k-shortest and constrained shortest path problems efficiently ⋮ Efficient modeling of travel in networks with time-varying link speeds ⋮ Heuristic shortest path algorithms for transportation applications: state of the art

This page was built for publication: Shortest paths with euclidean distances: An explanatory model