Packing congruent hyperspheres into a hypersphere
From MaRDI portal
Publication:427402
DOI10.1007/S10898-011-9716-ZzbMATH Open1244.90200OpenAlexW2138405342MaRDI QIDQ427402FDOQ427402
Authors: Georgiy Yaskov, Yu. Stoyan 
Publication date: 13 June 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9716-z
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
- A proof of the Kepler conjecture
- Title not available (Why is that?)
- A polyhedral branch-and-cut approach to global optimization
- Title not available (Why is that?)
- Global dynamics of a dengue epidemic mathematical model
- Cutting circles and polygons from area-minimizing rectangles
- Minimizing the object dimensions in circle and sphere packing problems
- A literature review on circle and sphere packing problems: models and methodologies
- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
- Solving the problem of packing equal and unequal circles in a circular container
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- New results in the packing of equal circles in a square
- Title not available (Why is that?)
Cited In (26)
- 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
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container
- Title not available (Why is that?)
- Packing circles into perimeter-minimizing convex hulls
- Title not available (Why is that?)
- A nonlinear programming model with implicit variables for packing ellipsoids
- 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
- Optimized packing multidimensional hyperspheres: a unified approach
- Quasi-phi-functions and optimal packing of ellipses
- Packing equal circles into a circle with circular prohibited areas
- Packing circles within ellipses
- Packing ellipsoids by nonlinear optimization
- Title not available (Why is that?)
- 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
- An efficient solution space exploring and descent method for packing equal spheres in a sphere
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
- Constructive high-dimensional sphere packings
- Packing unequal circles into a strip of minimal length with a jump algorithm
Uses Software
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)
