The fixed charge facility location problem with coverage restrictions

This: paper develops a fixed charge facility location model with coverage r estrictions, minimizing cost while maintaining an appropriate level of serv ice, in identifying facility locations. Further, it discusses the insights that call be gained using the model. Two Lagrangian relaxation based heuris tics are presented and tested. Both heuristics use a greedy adding algorith m to calculate upper bounds and subgradient optimization to calculate lower bounds. While both procedures are capable of generating good solutions, on e is computationally superior. (C) 2001 Elsevier Science Ltd. All rights re served.