Applications of Nonlinear Programming to Packing Problems
The problem of packing items within bounded regions in the Euclidean space has multiple applications in a variety of areas, such as, Physics, Chemistry, and Engineering. Problems of this type exhibit various levels of complexity. Nonlinear programming formulations and methods had been successfully applied to a wide range of packing problems. In this review paper, a brief description of the state-of-the-art and an illustrated overview of packing nonlinear programming techniques and applications will be presented.
KeywordsCutting Packing Nonlinear programming
- 1.Lang, R.J.: A computational algorithm for origami design. In: 12th ACM Symposium on Computational Geometry, pp. 98–105 (1996)Google Scholar
- 2.Wong, H.C., Kwan, A.K.H.: Packing density: a key concept for mix design of high performance concrete. In: Proceedings of the Materials Science and Technology in Engineering Conference, HKIE Materials Division, Hong Kong, pp. 1–15 (2005)Google Scholar
- 3.Osman, K.T.: Foerst Soils—Properties and Management. Springer, Cham (2013)Google Scholar
- 13.Stoyan, Y.G.: On the generalization of the dense allocation function. Rep. Ukr. SSR Acad. Sci. Ser. A 8, 70–74 (1980) (in Russian)Google Scholar