The base station placement problem, with n potential candidate sites is NP-Hard with 2n solutions. When dimensioned on m unknown variable settings (e.g., number of power settings + number of tilt settings, etc.) the computational complexity becomes (m+1)n. We introduce a novel approach to reduce the computational complexity by dimensioning sites only once to guarantee traffic hold requirements are satisfied. This approach works by determining the maximum set of service test points candidate sites can handle without exceeding a hard traffic constraint, TMAX.
