Editing Knapsack problem (section)

===Multiple knapsacks===
{{Main|Multiple knapsack problem}}
Here, there are multiple knapsacks. This may seem like a trivial change, but it is not equivalent to adding to the capacity of the initial knapsack, as each knapsack has its own capacity constraint. This variation is used in many loading and scheduling problems in Operations Research and has a [[Polynomial-time approximation scheme]].<ref>{{Cite journal |last=Chandra Chekuri and Sanjeev Khanna |date=2005 |title=A PTAS for the multiple knapsack problem |journal=SIAM Journal on Computing |volume=35 |issue=3 |pages=713–728 |citeseerx=10.1.1.226.3387 |doi=10.1137/s0097539700382820}}</ref>   This variation is similar to the [[Bin packing problem|Bin Packing Problem]]. It differs from the Bin Packing Problem in that a subset of items can be selected, whereas, in the Bin Packing Problem, all items have to be packed to certain bins.