A fast approximation algorithm for solving the complete set packing problem (Q2514810): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:37, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast approximation algorithm for solving the complete set packing problem |
scientific article |
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
