The sphere packing problem into bounded containers in three-dimension non-Euclidean space
Sign Up to like & getrecommendations! Published in 2018 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2018.11.450
Abstract: Abstract This paper deals with the problem of optimal packing a given number of equal spheres into different closed sets. We consider the problem both in three-dimensional Euclidean and non-Euclidean spaces. The special algorithm based… read more here.
Keywords: space; problem bounded; non euclidean; problem ... See more keywords
A global dichotomous search-based heuristic for the three-dimensional sphere packing problem
Sign Up to like & getrecommendations! Published in 2018 at "International Journal of Operational Research"
DOI: 10.1504/ijor.2018.10016371
Abstract: In this paper, we propose a global dichotomous search-based heuristic for solving the three-dimensional sphere packing problem. In the sphere packing problem, we are given a set of predefined unequal spheres and a large container… read more here.
Keywords: search; global dichotomous; dichotomous search; problem ... See more keywords