Master of Science
Gary E. Whitehouse
The location-allocation problem is treated from the standpoint of the computational efficiency of a mixed-integer programming formulation solved by a branch-and-bound algorithm. Previous formulations of the problem are analyzed and a new formulation is developed.
Fleisher, Robert E., "On the solution of the general single-stage location-allocation problem by a branch-and-bound algorithim" (1967). Theses and Dissertations. 3577.