A fast approximation algorithm for solving the complete set packing problem (Q2514810)

From MaRDI portal
Revision as of 16:11, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references