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 …

The problem of packing equal spheres in a spherical container is a classic global
optimization problem, which has attracted enormous studies in academia and found various …

The problem of packing unequal spheres into a multiconnected domain (container) is
considered. Given a set of spheres, the objective is to maximize the packing factor. The …

In this paper, the sphere packing problem is approximately solved with a population-based
method. The sphere packing problem, known as the three-dimensional knapsack, occurs in …

A problem of packing unequal spheres, which radii are known, into containers of various
shape are considered. An equivalent mathematical model to a standard sphere packing …

Nous nous intéressons à la résolution du problème de placement de sphères non identique
dans un container ouvert. Une instance de ce problème est représentée par un ensemble N …

Статья посвящена построению оптимальных упаковок набора шаров разных радиусов
в трехмерное замкнутое множество: требуется найти такое расположение …

Cutting and Packing (C&P) problems are encountered in numerous industrial domains such
as transportation, logistics, reliability, and production. They appear either as standalone …