Abstract
This paper considers the problem of optimally locating multi-activity facilities whose activity compositions are also to be determined. It is assumed that there are fixed costs associated both with establishing facilities and with including specific activities at the locations. This problem is examined under alternative assumptions concerning the facility capacities. Efficient branch-and-bound algorithms are developed, and extensive computational results are given.

This publication has 0 references indexed in Scilit: