Multiple multidimensional knapsack problem and its applications in cognitive radio networks

In this paper, a new variant of the standard knapsack problem is investigated and applied in cognitive radio networks. More specifically, the centralized spectrum allocation in cognitive radio networks is formulated as a multiple multidimensional knapsack problem. We propose an exact solution and a heuristic algorithm with guaranteed performance. The performance of the proposed algorithms are compared numerically.