Abstract
The multiple knapsack problem is a generalization of the standard knapsack problem (KP) from a single knapsack to m knapsacks with (possibly) different capacities. The objective is to assign each item to at most one of the knapsacks such that none of the capacity constraints are violated and the total profit of the items put into knapsacks is maximized.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kellerer, H., Pferschy, U., Pisinger, D. (2004). Multiple Knapsack Problems. In: Knapsack Problems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24777-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-24777-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07311-3
Online ISBN: 978-3-540-24777-7
eBook Packages: Springer Book Archive