Maximizing the sum of radii of balls inscribed in a polyhedral set
From MaRDI portal
(Redirected from Publication:2272896)
Recommendations
- Maximizing the sum of radii of disjoint balls or disks
- On the maximum and minimum radius problems over a polyhedral set
- Optimal inscribing of two balls into polyhedral set
- A note on the size of the largest ball inside a convex polytope
- Polytopal balls arising in optimization
- Maximum volume polytopes inscribed in the unit sphere
- scientific article; zbMATH DE number 1052535
- On successive radii of p-sums of convex bodies
- Extremal problems for spherical convex polygons
- scientific article; zbMATH DE number 3983565
Cites work
- A literature review on circle and sphere packing problems: models and methodologies
- A Packing Inequality for Compact Convex Subsets of the Plane
- Global optimization approach to Malfatti's problem
- Global search method for solving Malfatti's four-circle problem
- scientific article; zbMATH DE number 609933 (Why is no real title available?)
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- On the Original Malfatti Problem
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving Malfatti's high dimensional problem by global optimization
- Solving the problem of packing equal and unequal circles in a circular container
- Strips minimization in two-dimensional cutting stock of circular items
Cited in
(4)
This page was built for publication: Maximizing the sum of radii of balls inscribed in a polyhedral set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272896)
