Packing of convex polytopes into a parallelepiped

This article deals with the problem of packing convex polytopes into a parallelepiped of minimal height. It is assumed that the polytopes are oriented, i.e. rotations are not permitted. A mathematical model of the problem is developed and peculiarities of them are addressed. Based on these peculiari...

Full description

Saved in:
Bibliographic Details
Published inOptimization Vol. 54; no. 2; pp. 215 - 235
Main Authors Stoyan, Y. G., Gil, N. I., Scheithauer, G., Pankratov, A., Magdalina, I.
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.04.2005
Subjects
Mathematical modeling
Mathematics Subject Classifications: 90C11
Optimization
Packing
Polytope
Online AccessGet full text
ISSN0233-1934
1029-4945
DOI10.1080/02331930500050681

Cover

More Information
Summary:This article deals with the problem of packing convex polytopes into a parallelepiped of minimal height. It is assumed that the polytopes are oriented, i.e. rotations are not permitted. A mathematical model of the problem is developed and peculiarities of them are addressed. Based on these peculiarities an exact method to compute local optimal solutions is constructed. This method uses a special modification of the Simplex method. Some examples are also given.
ISSN:0233-1934
1029-4945
DOI:10.1080/02331930500050681