A Branch-Bound Algorithm for Plant Location

This paper discusses an integer-programming method for solving a special class of discrete programming problems called plant location. The basic contribution is that the problem is formulated as an integer program in such a way that the associated continuous problem can be efficiently optimized. A branch-bound algorithm is then used to solve the problem. The method discussed in the article has been successfully used to solve “practical” location problems with upwards of fifty plants.