Packing different cuboids with rotations and spheres into a cuboid

DOI10.1155/2014/571743zbMath1307.90217OpenAlexW1998281683WikidataQ59044520 ScholiaQ59044520MaRDI QIDQ2260526

A. M. Chugay, Yu. G. Stoyan

Publication date: 11 March 2015

Published in: Advances in Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/571743

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (6)

Two approaches to modeling and solving the packing problem for convex polytopes ⋮ Parallel computing technologies for solving optimization problems of geometric design ⋮ Multistage approach to solving the optimization problem of packing nonconvex polyhedra ⋮ \( \Phi \)-functions of 2D objects with boundaries being second-order curves ⋮ Optimized Object Packings Using Quasi-Phi-Functions ⋮ Sparsest balanced packing of irregular 3D objects in a cylindrical container

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Phi-functions for 2D objects formed by line segments and circular arcs
• Translational packing of arbitrary polytopes
• Packing cylinders and rectangular parallelepipeds with distances between them into a given region
• MIP-based heuristic for non-standard 3D-packing problems
• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
• Optimization. Algorithms and consistent approximations
• A global optimization point of view to handle non-standard object packing problems
• Mathematical modeling of the interaction of non-oriented convex polytopes
• Mathematical model and efficient algorithms for object packing problem
• The geometry of nesting problems: a tutorial
• Densest lattice packings of 3-polytopes.
• Mathematical modeling of interactions of primary geometric 3D objects
• Construction of a Φ-function for two convex polytopes

This page was built for publication: Packing different cuboids with rotations and spheres into a cuboid