An exact method for finding shortest routes on a sphere, avoiding obstacles

DOI10.1002/nav.21702zbMath1411.90347OpenAlexW2518119907MaRDI QIDQ4632937

Alan R. Washburn, Gerald G. Brown

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21702

zbMATH Keywords

finding shortest routesspherical mathematicsWetRoute

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (2)

Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier ⋮ Solving the Nearly Symmetric All-Pairs Shortest-Path Problem

This page was built for publication: An exact method for finding shortest routes on a sphere, avoiding obstacles