In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

Johannes O. Royset, W. Matthew Carlyle, R. Kevin Wood, Routing Military Aircraft With A Constrained Shortest-Path Algorithm, Military Operations Research, Vol. 14, No ...

This is a preview. Log in through your library . Abstract In this note we present some computational evidence to suggest that a version of Bellman's shortest-path algorithm outperforms ...

The idea here is that the user enters a start and end location and an algorithm then finds the most beautiful route, rather than the shortest one.