Denardo, Eric V.; Fox, Bennett L. Shortest-route methods: 1. Reaching, pruning, and buckets. (English) Zbl 0391.90089 Oper. Res. 27, 161-186 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 ReviewsCited in 39 Documents MSC: 90C35 Programming involving graphs or networks 05C35 Extremal problems in graph theory 68Q25 Analysis of algorithms and problem complexity 65K05 Numerical mathematical programming methods Keywords:algorithm; shortest-route methods; networks PDFBibTeX XMLCite \textit{E. V. Denardo} and \textit{B. L. Fox}, Oper. Res. 27, 161--186 (1979; Zbl 0391.90089) Full Text: DOI