Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:16, 30 January 2024
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
8 February 2011
0 references
packing
0 references
circles
0 references
strip packing problem
0 references
Knapsack problem
0 references
greedy method
0 references
parallelization
0 references
