Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10100-009-0103-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996188181 / rank | |||
Normal rank | |||
Revision as of 00:03, 20 March 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
