A fast approximation algorithm for solving the complete set packing problem (Q2514810)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6396788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast approximation algorithm for solving the complete set packing problem |
scientific article; zbMATH DE number 6396788 |
Statements
A fast approximation algorithm for solving the complete set packing problem (English)
0 references
4 February 2015
0 references
set packing problem
0 references
combinatorial auctions
0 references
winner determination problem
0 references
coalition structure generation
0 references
large-scale MILP
0 references
0 references
0.8066654801368713
0 references
0.7362361550331116
0 references
0.7278636693954468
0 references
0.7177926898002625
0 references
0.7172093987464905
0 references
