Two approaches to modeling and solving the packing problem for convex polytopes
From MaRDI portal
Publication:1616253
DOI10.1007/s10559-018-0059-3zbMath1421.52013OpenAlexW2883100519MaRDI QIDQ1616253
Y. E. Stoian, A. V. Pankratov, A. M. Chugay, Tatiana E. Romanova
Publication date: 1 November 2018
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-018-0059-3
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55) Combinatorial aspects of packing and covering (05B40)
Related Items (2)
Parallel computing technologies for solving optimization problems of geometric design ⋮ Multistage approach to solving the optimization problem of packing nonconvex polyhedra
Cites Work
- Quasi-phi-functions and optimal packing of ellipses
- Packing ellipsoids by nonlinear optimization
- Modeling close packing of 3D objects
- The method of artificial space dilation in problems of optimal packing of geometric objects
- Maximum packing densities of basic 3D objects
- Combinatorial configurations in balance layout optimization problems
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- 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
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Fast neighborhood search for two- and three-dimensional nesting problems
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- Optimized Object Packings Using Quasi-Phi-Functions
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
This page was built for publication: Two approaches to modeling and solving the packing problem for convex polytopes
