Container loading is a pivotal function for operating supply chains efficiently.
Underperformance results in unnecessary costs (eg cost of additional containers to be …

This paper reviews the most relevant literature on efficient models and methods for packing
circular objects/items into Euclidean plane regions where the objects/items and regions are …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

At the intersection of nonlinear and combinatorial optimization, quadratic programming has
attracted significant interest over the past several decades. A variety of relaxations for …

In additive manufacturing (also known as 3D printing), a layer-by-layer buildup process is
used for manufacturing parts. Modern laser 3D printers can work with various materials …

In this paper an optimized multidimensional hyperspheres packing problem (HPP) is
considered for a bounded container. Additional constraints, such as prohibited zones in the …

Mathematical programming is a language for describing optimization problems; it is based
on parameters, decision variables, objective function (s) subject to various types of …

This article addresses the generation of strong polyhedral relaxations for nonconvex,
quadratically constrained quadratic programs (QCQPs). Using the convex envelope of …

Cutting and packing problems occur in various real-world applications, like manufacturing,
production process, automated planning, logistics, and material industries. Most of these …

In this paper, we study the three-dimensional sphere packing which consists in finding the
greatest density of a (sub) set of predefined spheres (small items) into a three-dimensional …