Packing Convex 3D Objects with Special Geometric and Balancing Conditions
From MaRDI portal
Publication:5117307
DOI10.1007/978-3-030-33585-4_27zbMath1462.90111OpenAlexW2981834501MaRDI QIDQ5117307
No author found.
Publication date: 20 August 2020
Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-33585-4_27
Related Items (2)
The concept of modeling packing and covering problems using modern computational geometry software ⋮ Optimized packing multidimensional hyperspheres: a unified approach
Cites Work
- Quasi-phi-functions and optimal packing of ellipses
- On the global minimum in a balanced circular packing problem
- Modeling and optimization in space engineering.
- Packing circular-like objects in a rectangular container
- Balance layout problem for 3D-objects: mathematical model and solution methods
- The complexity of cutting complexes
- Modeling and optimization in space engineering. State of the art and new challenges
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Optimized packing clusters of objects in a rectangular container
- Optimized packings with applications
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting
- Optimized Object Packings Using Quasi-Phi-Functions
- Packing equal circles into a circle with circular prohibited areas
- Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
This page was built for publication: Packing Convex 3D Objects with Special Geometric and Balancing Conditions