Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 54, 2005 - Issue 2
173
Views
20
CrossRef citations to date
0
Altmetric
Original Articles

Packing of convex polytopes into a parallelepiped

, , , &
Pages 215-235 | Received 07 Jan 2004, Accepted 03 Dec 2004, Published online: 20 Aug 2006
 

Abstract

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.

Acknowledgement

The authors wish to thank the anonymous referee for her/his valuable remarks and hints which helped a lot to improve the presentation. This work was partially supported by the German Research Society (DFG, grant TE 207/7, 436 UKR 113/42/0).

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 630.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.