We present a new family of shortest-route methods, which reduce an upper bound on running time, and make empirical comparisons for a certain class of networks. These methods also allow for exploitation of structure by pruning arcs and/or nodes.
No takes yet. Share an insight, caveat, or question.
Denardo et al. (1979) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: