Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

Eric V. Denardo and Bennett L. Fox
Additional contact information
Eric V. Denardo: Yale University, New Haven, Connecticut
Bennett L. Fox: University of Montreal, Montreal, Quebec

Operations Research, 1979, vol. 27, issue 1, 161-186

Abstract: 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.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.1.161 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:27:y:1979:i:1:p:161-186

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().