A fast exact algorithm for discrete resource allocation with nested constraints

We aim to allocation B units of resources to n activities to minimize the total allocation cost, with additional bound constraints on resources consumed by subsets of activities. We develop an O(n log(Bn ))-time exact algorithm to solve the problem. Our algorithm is applicable to any separable convex cost function. Numerical experiments demonstrate that our algorithm significantly outperforms a state-of-the-art optimization solver.