In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

In this note we present some computational evidence to suggest that a version of Bellman's shortest-path algorithm outperforms Treesort-Dijkstra's for a certain class of networks.

This paper proposes a column generation algorithm for the multidepot vehicle routing problem with interdepot routes. This problem is an extension of the multidepot vehicle routing problem in which the ...