Sural, H.; van Wassenhove, L.N.; Potts, C.N. - Institut Européen d'Administration (INSEAD) - 1997
In the bounded knapsack problem with setups there are a limited number of copies of each item and the inclusion of an item in the knapsack requires a fixed setup capacity. Analysis of special cases of the problem allows us to derive the borderline between hard and easy problems. We develop a...