Convex maximization formulation of general sphere packing problem
From MaRDI portal
Publication:2307930
Recommendations
- Maximizing the sum of radii of balls inscribed in a polyhedral set
- Solving Malfatti's high dimensional problem by global optimization
- Global optimization approach to Malfatti's problem
- Packing congruent hyperspheres into a hypersphere
- Packing congruent spheres into a multi‐connected polyhedral domain
Cites work
- Approximate algorithms for constrained circular cutting problems
- Asymptotics and Mellin-Barnes integrals
- Computing a global optimal solution to a design centering problem
- DISCON: A New Method for the Layout Problem
- Global optimization approach to Malfatti's problem
- Global search method for solving Malfatti's four-circle problem
- Integrated container loading software for pulp and paper industry
- On local search in d.c. optimization problems
- Optimising the palletisation of cylinders in cases
- Solving Malfatti's high dimensional problem by global optimization
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
- The discrete p-dispersion problem
Cited in
(10)- Minimal surface convex hulls of spheres
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- Application of survival theory in mining industry
- Application of sphere packing theory in financial management
- A sphere packing approach to break even and profitability analysis
- Solving Malfatti's high dimensional problem by global optimization
- Augmented lagrangians and sphere packing problems
- Optimization and Optimal Control Approach to Japanese Sangaku Six Equal Circles Problem
- Optimal control sphere packing problem
- Convex and sphere packing approaches to portfolio optimization
This page was built for publication: Convex maximization formulation of general sphere packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307930)
