The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899)
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: The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio |
scientific article; zbMATH DE number 5615440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio |
scientific article; zbMATH DE number 5615440 |
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
0 references
0 references
0 references
0 references
0 references
0.8761980533599854
0 references
0.871963620185852
0 references
0.8317356109619141
0 references
0.8254957795143127
0 references
0.814207911491394
0 references
