The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899): 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.1016/j.cor.2009.05.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003153490 / rank | |||
Normal rank | |||
Revision as of 19:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio |
scientific article |
Statements
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (English)
0 references
15 October 2009
0 references
cutting and packing
0 references
rectangular strip packing
0 references
best-fit heuristic
0 references
time complexity
0 references
approximation ratio
0 references
