AbstractThis paper presents a heuristic method for solving the uncapacitated facility-location problem (UFLP), which is similar to Erlenkotter's‘dual ascent’procedure. The heuristic is of the‘add’type, which progressively selects facilities to open according to a certain criterion derived from the analysis of the linear programming dual. Computational experience with both (static) UFLPs and dynamic UFLPs reveals that the heuristic method yields solutions in most cases superior in quality to those achieved by the dual-ascent procedure, with barely noticeable additional computation time.