Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel greedy algorithms for packing unequal circles into a strip or a rectangle |
scientific article; zbMATH DE number 5847895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel greedy algorithms for packing unequal circles into a strip or a rectangle |
scientific article; zbMATH DE number 5847895 |
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
0 references
0 references
