Pages that link to "Item:Q1862200"

The following pages link to Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D (Q1862200):

Displaying 23 items.

• Modeling close packing of 3D objects (Q315021) (← links)
• Packing unequal spheres into various containers (Q334249) (← links)
• Stability and convergence analysis of a dynamics-based collective method for random sphere packing (Q340917) (← links)
• A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
• The discrete ellipsoid covering problem: a discrete geometric programming approach (Q496677) (← links)
• A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
• Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem (Q1001331) (← links)
• Packing cylinders and rectangular parallelepipeds with distances between them into a given region (Q1014938) (← links)
• A local search-based method for sphere packing problems (Q1634289) (← links)
• Monte Carlo study of the sphere packing problem (Q1865430) (← links)
• Optimized packing multidimensional hyperspheres: a unified approach (Q1979535) (← links)
• Advances in particle packing algorithms for generating the medium in the discrete element method (Q1986795) (← links)
• Optimized filling of a given cuboid with spherical powders for additive manufacturing (Q2059194) (← links)
• Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
• Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design (Q2419563) (← links)
• Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain (Q2495793) (← links)
• New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
• Covering a convex 3D polytope by a minimal number of congruent spheres (Q2931942) (← links)
• Packing identical spheres into a cylinder (Q3002688) (← links)
• GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID (Q3114612) (← links)
• Packing congruent spheres into a multi‐connected polyhedral domain (Q4921255) (← links)
• Digital model of natural cores using geometric design (Q6198093) (← links)