Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10100-009-0103-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10100-009-0103-5 / rank | |||
Normal rank | |||
Latest revision as of 22:46, 9 December 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
0 references
0 references
