The covering of non-convex polytope by a finite family of right parallelepipeds

MaRDI QIDQ3077571zbMATH OpenFDO

Authors E. S. Sosyurka, Yu. Stoyan

Publication date 22 February 2011

zbMATH Keywords

covering problemnon-convex polytope

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Packing of convex polytopes into a parallelepiped
• Mathematical modeling of the interaction of non-oriented convex polytopes
• The construction of a mathematical model and the solution of the problem of arrangement of convex \(n\)-dimensional polytopes in an \(n\)-dimensional parallelepiped
• A problem of packing homothetic convex polytopes
• On a set of problems on covering of a bounded set

Cited in

(1)

• The concept of modeling packing and covering problems using modern computational geometry software

This page was built for publication: The covering of non-convex polytope by a finite family of right parallelepipeds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077571)