Skip to main content
Book Chapter

Multiple Knapsack Problems

  • Kellerer H
  • Pferschy U
  • Pisinger D
Springer Berlin Heidelberg, (2004), 285-316
DOI: 10.1007/978-3-540-24777-7_10
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Multiple Knapsack Problems. In Knapsack Problems (pp. 285–316). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24777-7_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free