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

Authors:
Vernon Ning Hsu;Timothy J. Lowe;Arie Tamir
Affiliations:
School of Business Administration, George Mason University, Fairfax, VA 22030, USA;College of Management, University of Iowa, Iowa City, IA 52242, USA;School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel and Stern School of Business, New York University, New York, NY 10012, USA
Venue:
Operations Research Letters
Year:
1997

Citing 6
Cited 3

The concave least-weight subsequence problem revisited

Journal of Algorithms
A linear-time algorithm for concave one-dimensional dynamic programming

Information Processing Letters
Sequence comparison with mixed convex and concave costs

Journal of Algorithms
Improved algorithms for economic lot size problems

Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved complexity bounds for location problems on the real line

Operations Research Letters

An improved algorithm for the p-center problem on interval graphs with unit lengths

Computers and Operations Research
Improving customer proximity to railway stations

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
The connected p-center problem on block graphs with forbidden vertices

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.