Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818)

From MaRDI portal
Revision as of 02:55, 2 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
scientific article

    Statements

    Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (English)
    0 references
    0 references
    0 references
    0 references
    8 February 2011
    0 references
    0 references
    packing
    0 references
    circles
    0 references
    strip packing problem
    0 references
    Knapsack problem
    0 references
    greedy method
    0 references
    parallelization
    0 references