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

Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper we give an O(pn2) 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.

Original languageEnglish
Pages (from-to)159-164
Number of pages6
JournalOperations Research Letters
Volume21
Issue number4
DOIs
StatePublished - Nov 1997

Keywords

  • Computational complexity
  • Dynamic programming
  • Facility location

Fingerprint

Dive into the research topics of 'Structured p-facility location problems on the line solvable in polynomial time'. Together they form a unique fingerprint.

Cite this