Journal article
Convex Location Problems on Tree Networks
Operations research, Vol.24(4), pp.628-642
07/01/1976
DOI: 10.1287/opre.24.4.628
Abstract
This paper studies problems of finding optimal facility locations on an imbedding of a finite, undirected network having positive arc lengths. We establish that a large class of such problems is convex, in a well defined sense, for all choices of the data if and only if the network is a tree. A number of useful properties of related convex functions end convex sets are identified.
Details
- Title: Subtitle
- Convex Location Problems on Tree Networks
- Creators
- P. M. Dearing - Cornell UniversityR. L. Francis - University of FloridaT. J. Lowe - University of Florida
- Resource Type
- Journal article
- Publication Details
- Operations research, Vol.24(4), pp.628-642
- DOI
- 10.1287/opre.24.4.628
- ISSN
- 0030-364X
- eISSN
- 1526-5463
- Number of pages
- 15
- Language
- English
- Date published
- 07/01/1976
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963220102771
Metrics
1 Record Views