Optimized filling of a given cuboid with spherical powders for additive manufacturing
From MaRDI portal
Publication:2059194
DOI10.1007/s40305-020-00314-9zbMath1488.90123OpenAlexW3048657181MaRDI QIDQ2059194
Igor Lemishka, Zoya Duriagina, Alexandr Pankratov, Georgiy Yaskov, Igor S. Litvinchev, Tatiana E. Romanova, José Antonio Marmolejo
Publication date: 13 December 2021
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-020-00314-9
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Proportional packing of circles in a circular container, Digital model of natural cores using geometric design, Sparse balanced layout of spherical voids in three-dimensional domains
Cites Work
- Unnamed Item
- On the global minimum in a balanced circular packing problem
- Packing unequal spheres into various containers
- Stability and convergence analysis of a dynamics-based collective method for random sphere packing
- Packing circular-like objects in a rectangular container
- Balance layout problem for 3D-objects: mathematical model and solution methods
- Minimal surface convex hulls of spheres
- A local search-based method for sphere packing problems
- Modeling and optimization in space engineering. State of the art and new challenges
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- Packing ellipsoids in an optimized cylinder
- Packing ellipses in an optimized convex polygon
- Irregular packing problems: a review of mathematical models
- A hybrid chaos firefly algorithm for three-dimensional irregular packing problem
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID
- Decomposition-aggregation method for convex programming problems
- A tutorial in irregular shape packing problems
- Optimized Object Packings Using Quasi-Phi-Functions
- Decomposition Algorithm for Irregular Placement Problems
- Greedy algorithms for packing unequal circles into a rectangular container
