Structured p-facility location problems on the line solvable in polynomial time

Operations Research Letters

Volumn 21, Issue 4, 1997, Pages 159-164

  Hsu, Vernon Ning ^a   Lowe, Timothy J ^b   Tamir, Arie ^c,d  

^a GEORGE MASON UNIVERSITY   (United States)

^b UNIVERSITY OF IOWA   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

Computational complexity; Dynamic programming; Facility location

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; DYNAMIC PROGRAMMING; FUNCTIONS; INDUSTRIAL ECONOMICS; LOCATION; MATHEMATICAL MODELS; PROBLEM SOLVING;

ECONOMIC LOT SIZING RULES; UNIMODAL FUNCTIONS;

SITE SELECTION;

EID: 0031268372     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(97)00035-7     Document Type: Article

References (8)

1. A. Aggarwal, M. Klawe, S. Moran, P. Shor, R. Wilber, Geometric applications of a matrix searching algorithm, Algorithmica 2 (1987) 195-208.
2. A. Aggarwal, J. Park, Improved algorithms for economic lot size problems, Oper. Res. 41 (1993) 549-571.
3. D. Eppstein, Sequence comparison with mixed convex and concave costs, J. Algorithms 11 (1990) 85-101.
4. Z. Galil, K. Park, A linear-time algorithm for concave one-dimensional dynamic programming, Inform. Process. Lett. 33 (1989/90) 309-311.
5. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, 1979.
6. R. Hassin, A. Tamir, Improved complexity bounds for location problems on the real line, Oper. Res. Lett. 10 (1991) 395-402.
7. A. Kolen, Solving covering problems and the uncapacitated plant location problem on trees, European J. Oper. Res. 12 (1983) 266-278.
8. R. Wilber, The concave least-weight subsequence problem revisited, J. Algorithms 9 (1988) 418-425.