On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:17, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the weak computability of a four dimensional orthogonal packing and time scheduling problem |
scientific article |
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
