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

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

0.00 Avg rating—0 Votes
Article ID: iaor20003323
Country: Netherlands
Volume: 21
Issue: 4
Start Page Number: 159
End Page Number: 164
Publication Date: Nov 1997
Journal: Operations Research Letters
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.