| Article ID: | iaor20081158 |
| Country: | United Kingdom |
| Volume: | 17 |
| Issue: | 4 |
| Start Page Number: | 317 |
| End Page Number: | 348 |
| Publication Date: | Oct 2006 |
| Journal: | IMA Journal of Management Mathematics (Print) |
| Authors: | Captivo M. Eugnia, Clmaco Joo, Dias Joana |
| Keywords: | heuristics |
In this paper a capacitated dynamic location problem with opening, closure and reopening of facilities is formulated and a primal–dual heuristic that can solve this problem is described. In this problem both maximum and minimum capacity restrictions are considered. The problem formulated is NP-hard. Computational results are presented and discussed.