The Bounded Knapsack Problem with Setups

H. Sural, L.N. van Wassenhove and C.N. Potts

INSEAD from INSEAD, Centre for the Management of Environmental Resources. The European Institute of Business Administration.

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

Keywords: MATHEMATICS (search for similar items in EconPapers)
JEL-codes: C60 (search for similar items in EconPapers)
Pages: 19 pages
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:fth:insead:97/71

Access Statistics for this paper

More papers in INSEAD from INSEAD, Centre for the Management of Environmental Resources. The European Institute of Business Administration. INSEAD, Centre for the Management of Environmental Resources. The uropean Institute of Business Administration. Boulevard de Constance, 77305 Fontainebleau Cedex, France.. Contact information at EDIRC.
Bibliographic data for series maintained by ().