The Bounded Knapsack Problem with Setups

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.

MoreLess

Year of publication:	1997
Authors:	Sural, H. ; van Wassenhove, L.N. ; Potts, C.N.
Institutions:	Institut Européen d'Administration (INSEAD)
Subject:	MATHEMATICS

More details

Series:	INSEAD.
Type of publication:	Book / Working Paper
Notes:	19 pages
Classification:	C60 - Mathematical Methods and Programming. General
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005671860