Two approaches to modeling and solving the packing problem for convex polytopes (Q1616253)
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 6969969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two approaches to modeling and solving the packing problem for convex polytopes |
scientific article; zbMATH DE number 6969969 |
Statements
Two approaches to modeling and solving the packing problem for convex polytopes (English)
0 references
1 November 2018
0 references
packing polytopes into a parallelepiped with smallest volume
0 references
separating functions phi and quasi-phi
0 references
0 references
0 references
0 references
0.8865503072738647
0 references
0.8741464614868164
0 references
0.8631370663642883
0 references
0.8450357913970947
0 references
0.8395329713821411
0 references
