The Pk-median dynamic location problem is an uncapacited dynamic problem with a varying number of operating facilities (Pk) along its planning horizon. In this paper the authors give a 0-1 integer programming formulation for this problem, define upper and lower bounds and develop a 2-phase heuristic method that uses reduced feasible sets and a dynamic programming algorithm. Computational results are given for problems of up to 70 clients/potential facility location sites and 8 time periods.
