Resource title

The Bounded knapsack problem with setups

Resource image

image for OpenScout resource :: The Bounded knapsack problem with setups

Resource description

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 branch and bound algorithm for the general problem and present some computational results

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://flora.insead.edu/fichiersti_wp/inseadwp1997/97-71.pdf

Resource license

Copyright INSEAD. All rights reserved