The relative location problem deals with the problem of allocating n departments to n locations. Complete enumeration is time-consuming because there is a total of n! possible arrangements.

A. True
B. False