Sparse balanced layout of spherical voids in three-dimensional domains

DOI10.1007/s10559-021-00379-1zbMath1472.90131OpenAlexW3183678555MaRDI QIDQ2044059

Petro I. Stetsyuk, Y. E. Stoian, O. V. Pankratov, Tatiana E. Romanova, Yu. G. Stoyan

Publication date: 4 August 2021

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-021-00379-1

zbMATH Keywords

nonlinear programmingspherical objectsphi-functionr-algorithmsparse layout

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Related Items

Sparse balanced layout of ellipsoids

Cites Work

• Optimal placement of irradiation sources in the planning of radiotherapy: mathematical models and methods of solving
• On N. Z. Shor's three scientific ideas
• Packing ellipsoids into volume-minimizing rectangular boxes
• Theory and software implementations of Shor's \(r\)-algorithms
• Combinatorial configurations in balance layout optimization problems
• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• \(r\)-algorithms and ellipsoids
• Modeling and optimization in space engineering. State of the art and new challenges
• Shor's \(r\)-algorithms: theory and practice
• Optimized packing multidimensional hyperspheres: a unified approach
• A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
• Sparsest balanced packing of irregular 3D objects in a cylindrical container
• Optimized filling of a given cuboid with spherical powders for additive manufacturing
• Parallel computing technologies for solving optimization problems of geometric design
• Packing ellipsoids in an optimized cylinder
• Irregular packing problems: a review of mathematical models