Journal article
Locating Two Facilities on a Tree Subject to Distance Constraints
Transportation science, Vol.22(3), pp.199-208
08/1988
DOI: 10.1287/trsc.22.3.199
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.
Details
- Title: Subtitle
- Locating Two Facilities on a Tree Subject to Distance Constraints
- Creators
- E. Erkut - University of AlbertaR. L. Francis - University of FloridaT. J. Lowe - Purdue University West Lafayette
- Resource Type
- Journal article
- Publication Details
- Transportation science, Vol.22(3), pp.199-208
- DOI
- 10.1287/trsc.22.3.199
- ISSN
- 0041-1655
- eISSN
- 1526-5447
- Publisher
- INFORMS; CATONSVILLE
- Number of pages
- 10
- Language
- English
- Date published
- 08/1988
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963100902771
Metrics
1 Record Views