The Journal of the Operational Research Society, Vol. 48, No. 8 (Aug., 1997), pp. 804-809 (6 pages) A new algorithm for the generalised assignment problem is described in this paper. The algorithm is ...

Management Science, Vol. 34, No. 3, Focussed Issue on Heuristics (Mar., 1988), pp. 402-410 (9 pages) A new approximate algorithm for multidimensional zero-one knapsack problems with all positive ...

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