Journal article
A minimum length covering subgraph of a network
Annals of operations research, Vol.18(1), pp.245-259
12/1989
DOI: 10.1007/BF02097806
Abstract
This paper concerns the problem of locating a central facility on a connected networkN. The network,N, could be representative of a transport system, while the central facility takes the form of a connected subgraph ofN. The problem is to locate a central facility of minimum length so that each of several demand points onN is covered by the central facility: a demand point atv i inN is covered by the central facility if the shortest path distance betweenv i and the closest point in the central facility does not exceed a parameterr i . This location problem is NP-hard, but for certain special cases, efficient solution methods are available.
Details
- Title: Subtitle
- A minimum length covering subgraph of a network
- Creators
- Tae Ung Kim - Sungkyunkwan UniversityTimothy J. Lowe - Purdue University West LafayetteJames E. Ward - Purdue University West LafayetteRichard L. Francis - University of Florida
- Resource Type
- Journal article
- Publication Details
- Annals of operations research, Vol.18(1), pp.245-259
- DOI
- 10.1007/BF02097806
- ISSN
- 0254-5330
- eISSN
- 1572-9338
- Number of pages
- 15
- Language
- English
- Date published
- 12/1989
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963211702771
Metrics
1 Record Views