Optimized packing multidimensional hyperspheres: a unified approach
type: Item
instance of: scholarly article
title: Optimized packing multidimensional hyperspheres: a unified approach
zbMATH Open document ID: 1476.90291
author: Georgiy Yaskov
author: José Manuel Velarde Cantú
author: Yu. Stoyan
author: T. Romanova
author: I. Litvinchev
author: Sergey Yakovlev
published in: Mathematical Biosciences and Engineering
publication date: 2021-09-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7390426
zbMATH Keywords: packing
zbMATH Keywords: hypersphere
zbMATH Keywords: phi-function
zbMATH Keywords: mathematical modeling
zbMATH Keywords: optimization
zbMATH Keywords: open dimension problem
zbMATH Keywords: knapsack problem
describes a project that uses: Packmol
MaRDI profile type: Publication
full work available at URL: mbe.2020344
OpenAlex ID: W3087847502
Wikidata QID: Q104619333
cites work: Packing of unequal spheres and automated radiosurgical treatment planning
cites work: Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
cites work: Disk packing for the estimation of the size of a wire bundle
cites work: Strips minimization in two-dimensional cutting stock of circular items
cites work: Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels
cites work: Über einen geometrischen Satz
cites work: A proof of the Kepler conjecture
cites work: The sphere packing problem in dimension 8
cites work: A local search-based method for sphere packing problems
cites work: Balance layout problem for 3D-objects: mathematical model and solution methods
cites work: Packing Convex 3D Objects with Special Geometric and Balancing Conditions
cites work: On the global minimum in a balanced circular packing problem
cites work: Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
cites work: Combinatorial configurations in balance layout optimization problems
cites work: Mathematical model and efficient algorithms for object packing problem
cites work: The complexity of cutting complexes
cites work: An improved typology of cutting and packing problems
cites work: Coordinate descent algorithms
cites work: Greedy algorithms for packing unequal circles into a rectangular container
cites work: New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
cites work: Linear models for the approximate solution of the problem of packing equal circles into a given domain
cites work: Packing circular-like objects in a rectangular container
cites work: Packing equal circles into a circle with circular prohibited areas
cites work: Packing a fixed number of identical circles in a circular container with circular prohibited areas
cites work: Algorithms for the circular two‐dimensional open dimension problem
cites work: A literature review on circle and sphere packing problems: models and methodologies
cites work: Minimizing the object dimensions in circle and sphere packing problems
cites work: GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID
cites work: An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
cites work: Packing unequal spheres into various containers
cites work: Packing unequal circles into a strip of minimal length with a jump algorithm
cites work: Random packing of hyperspheres and Marsaglia's parking lot test
cites work: Geometric properties of random disk packings.
cites work: Packing congruent hyperspheres into a hypersphere
cites work: Mathematical modeling of interactions of primary geometric 3D objects
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: Packing of various radii solid spheres into a parallelepiped.
cites work: HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
cites work: On Numerical Issues of Interior Point Methods
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: The method of artificial space dilation in problems of optimal packing of geometric objects
cites work: Configuration space of geometric objects
cites work: Covering a polygonal region by rectangles
cites work: Packing ellipsoids in an optimized cylinder
cites work: Decomposition-aggregation method for convex programming problems
cites work: Localization of the optimal solution and a posteriori bounds for aggregation
cites work: Refinement of Lagrangian bounds in optimization problems
DOI: 10.3934/MBE.2020344
description: scientific article; zbMATH DE number 7390426