A fast approximation algorithm for solving the complete set packing problem
We study the complete set packing problem (CSPP) where the family of feasible subsets may include all possible combinations of objects. This setting arises in applications such as combinatorial auctions (for selecting optimal bids) and cooperative game theory (for finding optimal coalition structure...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2014-08-16.
|
| Subjects: | |
| Online Access: | Get fulltext |