Locating Two Facilities on a Tree Subject to Distance Constraints

E. Erkut, R. L. Francis and T. J. Lowe
Additional contact information
E. Erkut: University of Alberta, Edmonton, Canada T6G 2R6
R. L. Francis: University of Florida, Gainesville, Florida 32611
T. J. Lowe: Purdue University, West Lafayette, Indiana 47906

Transportation Science, 1988, vol. 22, issue 3, 199-208

Abstract: We wish to locate two new facilities on a tree network, where demands occur at vertices. We minimize any convex function which is nondecreasing in two related single facility convex objective functions, and in the distance between the facilities, subject to a distance constraint imposing an upper bound on the distance between the facilities, as well as to distance constraints imposing upper bounds on the distances between the new facilities and the demand points. We consider both vertex-restricted and vertex-unrestricted problem versions, and, for the latter problem, reduce the location problem when the constraint is tight to a problem of locating a single new facility on a path.

Date: 1988
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.22.3.199 (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:ortrsc:v:22:y:1988:i:3:p:199-208

Access Statistics for this article

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