Search
Now showing items 1-1 of 1
Binary knapsack problems with random budgets
(2003-10-21)
The binary knapsack problem is a combinatorial optimization problem in which a subset of a given set of elements
needs to be chosen in order to maximize profit, given a budget constraint. In this paper, we study a stochastic ...