Multistage approach to solving the optimization problem of packing nonconvex polyhedra
DOI10.1007/S10559-020-00241-WzbMATH Open1456.52022OpenAlexW3015712661MaRDI QIDQ2215293FDOQ2215293
Authors: A. M. Chugay, Yu. 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
Recommendations
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Two approaches to modeling and solving the packing problem for convex polytopes
- Optimized packing multidimensional hyperspheres: a unified approach
- A global optimization point of view to handle non-standard object packing problems
- Numerical optimization method for packing regular convex polygons
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
- A Multi-sphere Scheme for 2D and 3D Packing Problems
- Inverse convex programming and parallelepiped packing
- A semidefinite programming hierarchy for packing problems in discrete geometry
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
Nonlinear programming (90C30) Computer-aided design (modeling of curves and surfaces) (65D17) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Mathematical model and efficient algorithms for object packing problem
- Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped
- Mathematical modeling of the interaction of non-oriented convex polytopes
- Packing ellipsoids by nonlinear optimization
- Modeling close packing of 3D objects
- Maximum packing densities of basic 3D objects
- Packing different cuboids with rotations and spheres into a cuboid
- 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
- Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
Cited In (7)
- Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary
- A global optimization point of view to handle non-standard object packing problems
- Optimization of multiweighing packing proceedings
- A mathematical model and a method of solution the packing optimization problem for arbitrary 2D objects in rectangular domains
- A Multi-sphere Scheme for 2D and 3D Packing Problems
- Inverse convex programming and parallelepiped packing
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
Uses Software
This page was built for publication: Multistage approach to solving the optimization problem of packing nonconvex polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215293)
