On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 52C17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6244150 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computability | |||
| Property / zbMATH Keywords: computability / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
exact algorithm | |||
| Property / zbMATH Keywords: exact algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
higher dimensional packing | |||
| Property / zbMATH Keywords: higher dimensional packing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
real parameters | |||
| Property / zbMATH Keywords: real parameters / rank | |||
Normal rank | |||
Revision as of 14:10, 29 June 2023
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
