Normal view
MARC view
The Bounded knapsack problem with setups
Author: Van Wassenhove, Luk N. ; Süral, H ; Potts, C. N.INSEAD Area: Technology and Operations Management Series: Working Paper ; 97/71/TM Publisher: Fontainebleau : INSEAD, 1997.Language: EnglishDescription: 19 p.Type of document: INSEAD Working Paper Online Access: Click here 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| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
|
Digital Library | Available | BC001733 |
Total holds: 0
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
Digitized
There are no comments for this item.