Packing congruent hyperspheres into a hypersphere
From MaRDI portal
(Redirected from Publication:427402)
Recommendations
- Optimized packing multidimensional hyperspheres: a unified approach
- Packing congruent spheres into a multi‐connected polyhedral domain
- Packing a large number of congruent spheres into a cylinder
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
- Packing of various radii solid spheres into a parallelepiped.
Cites work
- scientific article; zbMATH DE number 3683608 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- A literature review on circle and sphere packing problems: models and methodologies
- A polyhedral branch-and-cut approach to global optimization
- A proof of the Kepler conjecture
- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
- Cutting circles and polygons from area-minimizing rectangles
- Global dynamics of a dengue epidemic mathematical model
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Minimizing the object dimensions in circle and sphere packing problems
- New results in the packing of equal circles in a square
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Solving the problem of packing equal and unequal circles in a circular container
Cited in
(26)- Packing unequal circles into a strip of minimal length with a jump algorithm
- Packing different cuboids with rotations and spheres into a cuboid
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Minimizing late deliveries in a truck loading problem
- scientific article; zbMATH DE number 1954152 (Why is no real title available?)
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container
- Packing circles into perimeter-minimizing convex hulls
- A nonlinear programming model with implicit variables for packing ellipsoids
- scientific article; zbMATH DE number 4054468 (Why is no real title available?)
- Convex maximization formulation of general sphere packing problem
- Random packing of hyperspheres and Marsaglia's parking lot test
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
- Quasi-phi-functions and optimal packing of ellipses
- Optimized packing multidimensional hyperspheres: a unified approach
- Packing equal circles into a circle with circular prohibited areas
- Packing circles within ellipses
- Packing ellipsoids by nonlinear optimization
- scientific article; zbMATH DE number 17631 (Why is no real title available?)
- Packing congruent spheres into a multi‐connected polyhedral domain
- A support tool for planning classrooms considering social distancing between students
- Constraints in container loading -- a state-of-the-art review
- Packing a large number of congruent spheres into a cylinder
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
- Constructive high-dimensional sphere packings
- An efficient solution space exploring and descent method for packing equal spheres in a sphere
This page was built for publication: Packing congruent hyperspheres into a hypersphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427402)
