scientific article; zbMATH DE number 2169484

MaRDI QIDQ4676928zbMATH OpenFDO

Authors

Publication date 20 May 2005

zbMATH Keywords

circlesmethod of feasible directionsoptimizationpacking

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial optimization (90C27)

Recommendations

• A mathematical model and a solution method of the packing problem of maximal number of equal circles into a non-convex region with prohibited areas
• Packing equal circles into a circle with circular prohibited areas
• Packing congruent spheres into a multi‐connected polyhedral domain
• Linear models for the approximate solution of the problem of packing equal circles into a given domain
• New results in the packing of equal circles in a square

Cited in

(9)

• Optimal packings for filled rings of circles.
• Linear models for the approximate solution of the problem of packing equal circles into a given domain
• Solving circle permutation packing problem
• A mathematical model and a solution method of the packing problem of maximal number of equal circles into a non-convex region with prohibited areas
• On a combinatorial structure of the problems of optimal packing of geometric objects
• Nondispersal and density properties of infinite packings
• Packing equal circles into a circle with circular prohibited areas
• Global optimization method for finding dense packings of equal circles in a circle
• Optimization and Optimal Control Approach to Japanese Sangaku Six Equal Circles Problem

This page was built for publication:

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