Journal article
Structured p-facility location problems on the line solvable in polynomial time
Operations research letters, Vol.21(4), pp.159-164
11/01/1997
DOI: 10.1016/S0167-6377(97)00035-7
Abstract
In this paper we give an O(
pn
2) algorithm for solving the
p-facility location problem on the line when the cost of serving any customer is a unimodal function of the location of the serving facilities. One application of our model is a generalization of the economic lot-sizing problem with backlogging allowed.
Details
- Title: Subtitle
- Structured p-facility location problems on the line solvable in polynomial time
- Creators
- Vernon Ning Hsu - George Mason UniversityTimothy J. Lowe - University of IowaArie Tamir - Tel Aviv University
- Resource Type
- Journal article
- Publication Details
- Operations research letters, Vol.21(4), pp.159-164
- DOI
- 10.1016/S0167-6377(97)00035-7
- ISSN
- 0167-6377
- eISSN
- 1872-7468
- Publisher
- Elsevier B.V
- Number of pages
- 6
- Language
- English
- Date published
- 11/01/1997
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963197902771
Metrics
1 Record Views