The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number ...

The general dynamic programming/branch-and-bound approach is applied to the traveling-salesman problem and the nonlinear knapsack problem. Our computational experience demonstrates that the hybrid ...

In this paper we introduce the knapsack problem for perishable inventories concerning the optimal dynamic allocation of a collection of products to a limited knapsack. The motivation for designing ...