Modeling Facility Location Problems as Generalized Assignment Problems.
TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES
Pagination or Media Count:
A variety of facility location models are shown to be equivalent to the generalized assignment problem. These location models include the p-median problem, the capacity contrained p-median problem and plant location problems in which customer demands must be satisfied by a single source. Further, it is shown how certain configuration constraints limiting site and capacity combinations can be incorporated into these models. Computational results are presented. Author
- Theoretical Mathematics