A Dual-Based Add Heuristic for Uncapacitated Facility Location
提出一种类似Erlenkotter对偶上升法的加法启发式方法，通过分析线性规划对偶逐步选择开设设施，在静态和动态无容量设施选址问题上比原方法解质量更高且计算时间几乎不变。
This 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.