Packing items into several bins facilitates approximating the separable assignment problem (Q2345851)

From MaRDI portal
Revision as of 21:56, 2 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57851339, #quickstatements; #temporary_batch_1706897434465)
scientific article
Language Label Description Also known as
English
Packing items into several bins facilitates approximating the separable assignment problem
scientific article

    Statements

    Packing items into several bins facilitates approximating the separable assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    21 May 2015
    0 references
    separable assignment problem
    0 references
    approximation algorithms
    0 references
    randomized rounding
    0 references

    Identifiers