Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped (Q466345): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6361623 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
mathematical modeling | |||
| Property / zbMATH Keywords: mathematical modeling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
optimization | |||
| Property / zbMATH Keywords: optimization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
packing | |||
| Property / zbMATH Keywords: packing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\(n\)-dimensional parallelepiped | |||
| Property / zbMATH Keywords: \(n\)-dimensional parallelepiped / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\(\Phi\)-function | |||
| Property / zbMATH Keywords: \(\Phi\)-function / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
NP-difficult problem | |||
| Property / zbMATH Keywords: NP-difficult problem / rank | |||
Normal rank | |||
Revision as of 14:06, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped |
scientific article |
Statements
Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped (English)
0 references
27 October 2014
0 references
mathematical modeling
0 references
optimization
0 references
packing
0 references
\(n\)-dimensional parallelepiped
0 references
\(\Phi\)-function
0 references
NP-difficult problem
0 references
