Journal article
Locating facilities which interact: Some solvable cases
Annals of operations research, Vol.40(1), pp.101-124
12/1992
DOI: 10.1007/BF02060472
Abstract
The network version of them-median problem with mutual communication (MMMC) is to find the location ofm new facilities on a network withn nodes such that the sum of (a) the cost of interaction between the new facilities andn existing facilities on the network, and (b) the cost of interaction between pairs of new facilities is minimized. The existing facilities are located at nodes of the network and the interaction cost between a pair of facilities is a function of the network distance between the facilities. This problem is shown to be equivalent to a graph-theoretic Node Selection Problem (NSP). We show that many other problems can be formulated as an NSP. We then provide a polynomial time algorithm to solve NSP for the case when the flow graph is Halin. Extensions to other graph families are provided.
Details
- Title: Subtitle
- Locating facilities which interact: Some solvable cases
- Creators
- Dilip Chhajed - University of Illinois Urbana-ChampaignTimothy J. Lowe - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Annals of operations research, Vol.40(1), pp.101-124
- DOI
- 10.1007/BF02060472
- ISSN
- 0254-5330
- eISSN
- 1572-9338
- Number of pages
- 24
- Language
- English
- Date published
- 12/1992
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963216802771
Metrics
1 Record Views