<p>Your problem is <em>the multiple knapsack problem</em>.</p>

<p>Although I am not familiar with this problem, I believe you'll find some papers on your problem, since there are many papers on this problem (see for example a <a href="http://dl.acm.org/citation.cfm?id=1496843">SODA 2009 paper</a>)</p>

CC BY-SA 3.0
2012-02-08T14:33:22.890Z
It actually seems that the full problem (with the restrictions) is a standard problem, too. Kellerer et al. (*Knapsack Problems*, Springer, 2004) call it *the multiple knapsack problem with assignment restrictions*. There’s even a name for the unit cost verison (i.e., the one I’m dealin with): *Multiple subset sum problem with assignment restrictions*. There’s even a publication on approximations for it by [Dawande et al](http://www.springerlink.com/content/q5l43k4155w25346/).
Magnus Lie Hetland
CC BY-SA 3.0
2012-02-13T01:03:59.987Z
There is an even further generalization called the generalized assignment problem (the maximization version) where the size of an item depends on the bin it is assigned to and so does the profit. There is a $(1-1/e-\delta)$-approximation for this problem for some tiny $\delta$ but the $(1-1/e)$-approximation is some what clean and nice.
Chandra Chekuri
CC BY-SA 3.0
2012-02-08T11:33:46.787Z
2012-02-08T11:33:46.787Z
Snowie
<p>My problem is related to the standard bin packing problem (where you have bins of capacity $1$, items of capacity $(0,1]$, and want to pack the items into as few bins as possible), but there are a couple of twists. First, you have a fixed number of bins, and want to fit as many items as possible into them. As far as I can see, this is not obviously equivalent (except for the decision versions of the problems). Or perhaps I’m missing something obvious?</p>

<p>Second, some items are not permitted in some bins. That is, for each item, there is a list of forbidden bins.</p>

<p>Does this problem have a name? Even a name for the version without the forbidden bins would be useful. (I’m sure the “as many items as possible” part must be a totally standard packing problem?)</p>

<p>What I’m ultimately looking for is a way of attacking the problem (an exponential, exact DP algorithm; an approximation algorithm; a good heuristic/B&amp;B solution…), or some starting-point that could be adapted.</p>

<ds.algorithms><approximation-algorithms><heuristics><packing><dynamic-programming>
Does this bin packing problem have a name?
Magnus Lie Hetland
# Does this bin packing problem have a name?

(Asked by: username_0 on 2012-02-08)

My problem is related to the standard bin packing problem (where you have bins of capacity $1$, items of capacity $(0,1]$, and want to pack the items into as few bins as possible), but there are a couple of twists. First, you have a fixed number of bins, and want to fit as many items as possible into them. As far as I can see, this is not obviously equivalent (except for the decision versions of the problems). Or perhaps I’m missing something obvious?

Second, some items are not permitted in some bins. That is, for each item, there is a list of forbidden bins.

Does this problem have a name? Even a name for the version without the forbidden bins would be useful. (I’m sure the “as many items as possible” part must be a totally standard packing problem?)

What I’m ultimately looking for is a way of attacking the problem (an exponential, exact DP algorithm; an approximation algorithm; a good heuristic/B&B solution…), or some starting-point that could be adapted.

**Tags:** ds.algorithms, approximation-algorithms, heuristics, packing, dynamic-programming


---

## 1 answers

### Answer by username_1 on 2012-02-08. Score: 8 | Accepted answer

Your problem is *the multiple knapsack problem*.

Although I am not familiar with this problem, I believe you'll find some papers on your problem, since there are many papers on this problem (see for example a [SODA 2009 paper](http://dl.acm.org/citation.cfm?id=1496843))

> **Comments:**
> **username_0**: It actually seems that the full problem (with the restrictions) is a standard problem, too. Kellerer et al. (*Knapsack Problems*, Springer, 2004) call it *the multiple knapsack problem with assignment restrictions*. There’s even a name for the unit cost verison (i.e., the one I’m dealin with): *Multiple subset sum problem with assignment restrictions*. There’s even a publication on approximations for it by [Dawande et al](http://www.springerlink.com/content/q5l43k4155w25346/).  
> **username_2**: There is an even further generalization called the generalized assignment problem (the maximization version) where the size of an item depends on the bin it is assigned to and so does the profit. There is a $(1-1/e-\delta)$-approximation for this problem for some tiny $\delta$ but the $(1-1/e)$-approximation is some what clean and nice.  

---

