Journal article
A multimedian problem with interdistance constraints
Environment & Planning B: Planning and Design, Vol.15(2), pp.181-190
06/1988
DOI: 10.1068/b150181
Abstract
The location of n new facilities on a network when the objective function is a sum of weighted distances between new and existing facilities, plus a sum of weighted distances between new facilities is studied. Interdistance constraints which impose upper bounds on distances between facilities have been included. A linear programming approach has been developed which solves the problem exactly on any spanning tree of the network, and which yields a lower bounding problem when the network is cyclic. The gap between the best spanning tree solution and the lower bound averages about 4% in the computational studies.
Details
- Title: Subtitle
- A multimedian problem with interdistance constraints
- Creators
- E. Erkut - University of AlbertaR. L. Francis - University of FloridaT. J. Lowe - Purdue University West Lafayette
- Resource Type
- Journal article
- Publication Details
- Environment & Planning B: Planning and Design, Vol.15(2), pp.181-190
- DOI
- 10.1068/b150181
- ISSN
- 0265-8135
- eISSN
- 1472-3417
- Number of pages
- 10
- Language
- English
- Date published
- 06/1988
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963109102771
Metrics
1 Record Views