Continuous maximin knapsack problems with GLB constraints

This paper introduces the continuous minimax knapsack problem with generalized lower bound constraints and describes an algorithm that solves this problem in O(n logn) time. We also discuss the related problem with generalized upper bound constraints.