Optimized filling of a given cuboid with spherical powders for additive manufacturing

Z Duriagina, I Lemishka, I Litvinchev… - Journal of the …, 2021 - Springer
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 …

Sparsest balanced packing of irregular 3D objects in a cylindrical container

T Romanova, Y Stoyan, A Pankratov, I Litvinchev… - European Journal of …, 2021 - Elsevier
Sparsest packing for irregular 3D objects is introduced. This problem is motivated by the
thermal deburring–modern clean and energy saving technology of removing burrs from …

Optimized packings in space engineering applications: Part I

Y Stoyan, A Pankratov, T Romanova, G Fasano… - … State of the Art and New …, 2019 - Springer
Packing optimization problems have a wide spectrum of real-word applications, including
transportation, logistics, chemical/civil/mechanical/power/aerospace engineering …

Perturbation-based thresholding search for packing equal circles and spheres

X Lai, JK Hao, R **ao, F Glover - INFORMS Journal on …, 2023 - pubsonline.informs.org
This paper presents an effective perturbation-based thresholding search for two popular and
challenging packing problems with minimal containers: packing N identical circles in a …

A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption

PL Bartlett, V Gabillon, M Valko - Algorithmic Learning …, 2019 - proceedings.mlr.press
We study the problem of optimizing a function under a\emph {budgeted number of
evaluations}. We only assume that the function is\emph {locally} smooth around one of its …

Packing oblique 3D objects

A Pankratov, T Romanova, I Litvinchev - Mathematics, 2020 - mdpi.com
Packing irregular 3D objects in a cuboid of minimum volume is considered. Each object is
composed of a number of convex shapes, such as oblique and right circular cylinders, cones …

[HTML][HTML] Nonlinear Optimization and Adaptive Heuristics for Solving Irregular Object Packing Problems

JD Pintér, I Castillo, FJ Kampas - Algorithms, 2024 - mdpi.com
We review and present several challenging model classes arising in the context of finding
optimized object packings (OP). Except for the smallest and/or simplest general OP model …

Packing ovals in optimized regular polygons

FJ Kampas, JD Pintér, I Castillo - Journal of Global Optimization, 2020 - Springer
We present a model development framework and numerical solution approach to the
general problem-class of packing convex objects into optimized convex containers …

Optimized ellipse packings in regular polygons

FJ Kampas, I Castillo, JD Pintér - Optimization Letters, 2019 - Springer
We present model development and numerical solution approaches to the problem of
packing a general set of ellipses without overlaps into an optimized polygon. Specifically, for …

How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results

JD Pintér - Annals of Operations Research, 2018 - Springer
Nonlinear optimization (NLO) encompasses a vast range of problems, from very simple to
theoretically intractable instances. For this reason, it is impossible to offer guaranteed …