A Multimedian Problem with Interdistance Constraints

E Erkut, R L Francis and T J Lowe
Additional contact information
E Erkut: Department of Finance and Management Science, Faculty of Business, University of Alberta, Edmonton, Canada T6G 2R6
R L Francis: Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA
T J Lowe: Krannert Graduate School of Management, Purdue University, West Lafayette, IN 47907, USA

Environment and Planning B, 1988, vol. 15, issue 2, 181-190

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.

Date: 1988
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b150181 (text/html)

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:sae:envirb:v:15:y:1988:i:2:p:181-190

DOI: 10.1068/b150181

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().