We present a simple dual ascent method for the multilevel facility location problem which finds a solution within $6$ times the optimum for the uncapacitated case and within $12$ times the optimum for the capacitated one. The algorithm is deterministic and based on the primal-dual technique.
|Place of Publication||Enschede|
|Publisher||University of Twente, Department of Applied Mathematics|
|Number of pages||9|
|Publication status||Published - 2001|
|Name||Memorandum Faculteit TW|
|Publisher||Department of Applied Mathematics, University of Twente|
Bumb, A. F., & Kern, W. (2001). A simple dual ascent algorithm for the multilevel facility location problem. (Memorandum Faculteit TW; No. 1574). Enschede: University of Twente, Department of Applied Mathematics.