On a comparison between the strip packing problem and a scheduling problem (Q3115698)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6004957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a comparison between the strip packing problem and a scheduling problem |
scientific article; zbMATH DE number 6004957 |
Statements
10 February 2012
0 references
combinatorial optimization
0 references
0.7798466086387634
0 references
0.7798466086387634
0 references
0.765329897403717
0 references
0.7493046522140503
0 references
