CODEWITHSUNDEEP
mathematical-optimizationknapsack-problem
mohamed
mohamed

Reputation: 33

knapsack with different profits and weights

I have n items and m knapsacks. Each item has a profit and weight that depend on on which knapsack to put the item in. For example, for item 1, the profits are 9 and 10 for knapsacks m=1 and 2 respectively.Also, the weights of item 1 are 3 Kg and 4 Kg for knapsacks m=1 and 2 respectively. what category of knapsacks problems does this problem belong to?. Is there an efficient method to solve such problem?.

I really appreciate your assistance.

Upvotes: 0

Views: 475

Answers (1)

LarrySnyder610
LarrySnyder610

Reputation: 2397

This is called the multiple knapsack problem and is also related to the bin-packing problem. Some googling should get you some basic references. It's NP-hard but there are decent algorithms.

Upvotes: 1

Related Questions