Parallel computing technologies for solving optimization problems of geometric design

DOI10.1007/s10559-019-00199-4zbMath1442.90184OpenAlexW2992056182MaRDI QIDQ2174043

S. B. Shekhovtsov, A. M. Chugay, Petro I. Stetsyuk, Tatiana E. Romanova

Publication date: 17 April 2020

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

Full work available at URL: https://doi.org/10.1007/s10559-019-00199-4

zbMATH Keywords

nonlinear programmingparallel computingphi-functionplacement of geometric objects

Mathematics Subject Classification ID

Nonlinear programming (90C30) Combinatorial optimization (90C27)

Related Items

Sparse balanced layout of ellipsoids, The concept of modeling packing and covering problems using modern computational geometry software, Digital model of natural cores using geometric design, Sparse balanced layout of spherical voids in three-dimensional domains

Cites Work

• Modeling close packing of 3D objects
• On the global minimum in a balanced circular packing problem
• Robust mixed-integer linear programming models for the irregular strip packing problem
• Packing circular-like objects in a rectangular container
• Theory and software implementations of Shor's \(r\)-algorithms
• Maximum packing densities of basic 3D objects
• Balance layout problem for 3D-objects: mathematical model and solution methods
• Two approaches to modeling and solving the packing problem for convex polytopes
• Configuration space of geometric objects
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation
• Shor's \(r\)-algorithms: theory and practice
• Placement problems for irregular objects: mathematical modeling, optimization and applications
• Packing different cuboids with rotations and spheres into a cuboid
• Mathematical modeling of the interaction of non-oriented convex polytopes
• Packing ellipses in an optimized convex polygon
• Optimized packing clusters of objects in a rectangular container
• Irregular Packing Using the Line and Arc No-Fit Polygon
• Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
• Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting
• Optimized Object Packings Using Quasi-Phi-Functions