Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
From MaRDI portal
Publication:1862200
DOI10.1023/A:1016083231326zbMATH Open1026.90078OpenAlexW988732486MaRDI QIDQ1862200FDOQ1862200
Authors: Yanyan Li 
Publication date: 10 March 2003
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1016083231326
Recommendations
- A global optimization algorithm for the three-dimensional packing problem
- Global optimization for the three-dimensional open-dimension rectangular packing problem
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
- A global optimization point of view to handle non-standard object packing problems
- A Multi-sphere Scheme for 2D and 3D Packing Problems
- Quasi-physical global optimization method for solving the equal circle packing problem
- A local search-based method for sphere packing problems
- Convex maximization formulation of general sphere packing problem
- Global optimization method for finding dense packings of equal circles in a circle
nonconvex quadratic programmingheuristic algorithmsLP relaxationsimplicial branch-and-bound algorithmunequal sphere packing problem
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)
Cites Work
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Handbook of global optimization
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- A relaxation method for nonconvex quadratically constrained quadratic programs
- On Three-Dimensional Packing
- On generalized bisection of 𝑛-simplices
- Packing of unequal spheres and automated radiosurgical treatment planning
Cited In (31)
- An efficient dense and stable particular elements generation method based on geometry
- Advances in particle packing algorithms for generating the medium in the discrete element method
- Title not available (Why is that?)
- Packing identical spheres into a cylinder
- New bounds for nonconvex quadratically constrained quadratic programming
- STUDY OF THE UNEQUAL SPHERES PACKING PROBLEM: AN APPLICATION TO RADIOSURGERY TREATMENT
- Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain
- Optimized packing multidimensional hyperspheres: a unified approach
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Using general triangle inequalities within quadratic convex reformulation method
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
- Experimental Design Problems and Nash Equilibrium Solutions
- Modeling close packing of 3D objects
- A literature review on circle and sphere packing problems: models and methodologies
- Optimized filling of a given cuboid with spherical powders for additive manufacturing
- Covering a convex 3D polytope by a minimal number of congruent spheres
- Digital model of natural cores using geometric design
- Packing unequal spheres into various containers
- Unequal sphere packing problem in the context of stereotactic radiosurgery
- A local search-based method for sphere packing problems
- Stability and convergence analysis of a dynamics-based collective method for random sphere packing
- Global optimization for the three-dimensional open-dimension rectangular packing problem
- Packing congruent spheres into a multi‐connected polyhedral domain
- Packing of unequal spheres and automated radiosurgical treatment planning
- The discrete ellipsoid covering problem: a discrete geometric programming approach
- Constraints in container loading -- a state-of-the-art review
- Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem
- Greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
- Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design
- Monte Carlo study of the sphere packing problem
Uses Software
This page was built for publication: Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862200)
