Maximizing the sum of radii of balls inscribed in a polyhedral set
From MaRDI portal
Publication:2272896
DOI10.26516/1997-7670.2019.28.138zbMath1434.90152OpenAlexW2951506351WikidataQ127657954 ScholiaQ127657954MaRDI QIDQ2272896
Dzamsranzhav Davaadulam, Rénzén Énkhbat
Publication date: 17 September 2019
Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)
Full work available at URL: http://mathizv.isu.ru/en/article/file?id=1303
Cites Work
- Global optimization approach to Malfatti's problem
- Solving Malfatti's high dimensional problem by global optimization
- Global search method for solving Malfatti's four-circle problem
- A literature review on circle and sphere packing problems: models and methodologies
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving the problem of packing equal and unequal circles in a circular container
- Strips minimization in two-dimensional cutting stock of circular items
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- On the Original Malfatti Problem
- A Packing Inequality for Compact Convex Subsets of the Plane
- Unnamed Item
This page was built for publication: Maximizing the sum of radii of balls inscribed in a polyhedral set
