Name
Title | ||
|---|---|---|
The plant location problem with demand-dependent setup costs and centralized allocation |
Abstract | ||
|---|---|---|
Suppose that customers are situated at the nodes of a transportation network, and a service company plans to locate a number of facilities that will serve the customers. The objective is to minimize the sum of the total setup cost and the total transportation cost. The setup cost of a facility is demand-dependent, that is, it depends on the number of customers that are served by the facility. Centralized allocation of customers to facilities is assumed, that is, the service company makes a decision about allocation of customers to facilities. In the case of a general network, the model can be formulated as a mixed integer programming problem. For the case of a tree network, we develop a polynomial-time dynamic programming algorithm. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1016/S0377-2217(97)00361-5 | European Journal of Operational Research |
Keywords | Field | DocType |
polynomial time,dynamic programming algorithm | Situated,Flow network,Dynamic programming,Transportation cost,Mathematical optimization,Integer programming,Time complexity,Operations management,Mathematics,Tree network | Journal |
Volume | Issue | ISSN |
111 | 3 | 0377-2217 |
Citations | PageRank | References |
6 | 0.59 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Averbakh | 1 | 699 | 54.76 |
| O. Berman | 2 | 1604 | 231.36 |
| Zvi Drezner | 3 | 1195 | 140.69 |
| George O. Wesolowsky | 4 | 227 | 21.32 |