Bio-inspired computational methods have gained popularity recently. These methods mimic the seemingly complex behavior of ...

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 of ...

The Journal of the Operational Research Society, Vol. 47, No. 3 (Mar., 1996), pp. 457-462 (6 pages) In this paper we present a new branch and bound algorithm for solving a class of integer quadratic ...

The knapsack sharing problem has a utility or tradeoff function for each variable and seeks to maximize the value of the smallest tradeoff function (a maximin objective function). A single constraint ...