Optimized packing multidimensional hyperspheres: a unified approach
From MaRDI portal
Publication:1979535
DOI10.3934/mbe.2020344zbMath1476.90291OpenAlexW3087847502WikidataQ104619333 ScholiaQ104619333MaRDI QIDQ1979535
José Manuel Velarde Cantú, Georgiy Yaskov, Igor S. Litvinchev, Tatiana E. Romanova, Yu. G. Stoyan, S. V. Yakovliev
Publication date: 3 September 2021
Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/mbe.2020344
optimizationpackingknapsack problemmathematical modelinghyperspherephi-functionopen dimension problem
Related Items
Sparse balanced layout of ellipsoids, Sparse balanced layout of spherical voids in three-dimensional domains, Iterated dynamic thresholding search for packing equal circles into a circular container
Uses Software
Cites Work
- On the global minimum in a balanced circular packing problem
- Packing unequal spheres into various containers
- Packing congruent hyperspheres into a hypersphere
- Packing circular-like objects in a rectangular container
- Covering a polygonal region by rectangles
- A literature review on circle and sphere packing problems: models and methodologies
- The method of artificial space dilation in problems of optimal packing of geometric objects
- Combinatorial configurations in balance layout optimization problems
- Balance layout problem for 3D-objects: mathematical model and solution methods
- Strips minimization in two-dimensional cutting stock of circular items
- The complexity of cutting complexes
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Localization of the optimal solution and a posteriori bounds for aggregation
- Packing of various radii solid spheres into a parallelepiped.
- A local search-based method for sphere packing problems
- Configuration space of geometric objects
- Disk packing for the estimation of the size of a wire bundle
- A polyhedral branch-and-cut approach to global optimization
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- Geometric properties of random disk packings.
- Packing of unequal spheres and automated radiosurgical treatment planning
- Packing ellipsoids in an optimized cylinder
- Mathematical model and efficient algorithms for object packing problem
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Coordinate descent algorithms
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- The sphere packing problem in dimension 8
- Packing unequal circles into a strip of minimal length with a jump algorithm
- Minimizing the object dimensions in circle and sphere packing problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A proof of the Kepler conjecture
- Mathematical modeling of interactions of primary geometric 3D objects
- An improved typology of cutting and packing problems
- Über einen geometrischen Satz
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels
- Random packing of hyperspheres and Marsaglia's parking lot test
- GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- Decomposition-aggregation method for convex programming problems
- On Numerical Issues of Interior Point Methods
- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
- Algorithms for the circular two‐dimensional open dimension problem
- Packing equal circles into a circle with circular prohibited areas
- Packing Convex 3D Objects with Special Geometric and Balancing Conditions
- Greedy algorithms for packing unequal circles into a rectangular container
- Refinement of Lagrangian bounds in optimization problems
