Results 1 to 10 of about 111 (83)
Convex Maximization Formulation of General Sphere Packing Problem
We consider a general sphere packing problem which is to pack nonoverlapping spheres (balls) with the maximum volume into a convex set. This problem has important applications in science and technology.
R. Enkhbat
doaj +1 more source
Maximizing the Sum of Radii of Balls Inscribed in a Polyhedral Set
The sphere packing problem is one of the most applicable areas in mathematics which finds numerous applications in science and technology [1–4;8;9;11–14].
R. Enkhbat, J. Davaadulam
doaj +1 more source
Extended General Malfatti’s Problem
Malfatti’s problem involves three circles (called Malfatti circles) that are tangent to each other and two sides of a triangle. In this study, our objective is to extend the problem to find 6, 10, … ∑1ni (n > 2) circles inside the triangle so that the ...
Ching-Shoei Chiang
doaj +1 more source
The Various Radii Circle Packing Problem in a Triangle
Malfatti’s problem is the problem of fitting three circles into a triangle such that they are tangent to each other and each circle is also tangent to a pair of the triangle’s sides.
Ching-Shoei Chiang, Yi-Ting Chiang
doaj +1 more source
Global search method for solving Malfatti’s four-circle problem
We consider Malfatti’s problem formulated 200 years ago. In the beginning, Malfatti’s problem was supposed to be solved in a geometric construction way. In 1994, it was done by Zalgaller and Los for the original Malfatti’s problem using so-called greedy ...
R. Enkhbat, M. Barkova
doaj
Some of the next articles are maybe not open access.
“Sticky Information” and the Locus of Problem Solving: Implications for Innovation
Management Science, 1994Eric Von Hippel
exaly
The Difficult Problem of Acute Myeloid Leukemia in the Older Adult
Ca-A Cancer Journal for Clinicians, 2002Richard M Stone
exaly

