Tight Approximation Algorithms for Maximum Separable Assignment Problems
A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f[subscript ij], for assigning item j to bin i; and a separate packing constraint for each bin—i.e., for each bin, a family of subsets of items that fit in to that bin. The goal is to pa...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2013
|
| Online Access: | http://hdl.handle.net/1721.1/80849 https://orcid.org/0000-0002-0520-1165 |