Multistage approach to solving the optimization problem of packing nonconvex polyhedra

DOI10.1007/S10559-020-00241-WzbMath1456.52022OpenAlexW3015712661MaRDI QIDQ2215293

A. M. Chugay, Yu. G. Stoyan

Publication date: 11 December 2020

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

Full work available at URL: https://doi.org/10.1007/s10559-020-00241-w

zbMATH Keywords

nonlinear optimizationpackingnonconvex polyhedra\( \Phi \)-function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Computer-aided design (modeling of curves and surfaces) (65D17)

Uses Software

• Ipopt

Cites Work

• Packing ellipsoids by nonlinear optimization
• Modeling close packing of 3D objects
• Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped
• Maximum packing densities of basic 3D objects
• Two approaches to modeling and solving the packing problem for convex polytopes
• A global optimization point of view to handle non-standard object packing problems
• Packing different cuboids with rotations and spheres into a cuboid
• Mathematical modeling of the interaction of non-oriented convex polytopes
• Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
• Mathematical model and efficient algorithms for object packing problem
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

This page was built for publication: Multistage approach to solving the optimization problem of packing nonconvex polyhedra