On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303)
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: On the weak computability of a four dimensional orthogonal packing and time scheduling problem |
scientific article; zbMATH DE number 6244150
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the weak computability of a four dimensional orthogonal packing and time scheduling problem |
scientific article; zbMATH DE number 6244150 |
Statements
On the weak computability of a four dimensional orthogonal packing and time scheduling problem (English)
0 references
10 January 2014
0 references
computability
0 references
exact algorithm
0 references
scheduling
0 references
higher dimensional packing
0 references
real parameters
0 references
0 references
0 references
0.83900595
0 references
0.8301542
0 references
0.8268886
0 references
0.8236679
0 references
0.8226464
0 references
0.82168984
0 references
0.8199639
0 references
0.81934243
0 references
