Packing congruent spheres into a multi‐connected polyhedral domain

DOI10.1111/j.1475-3995.2012.00859.xzbMath1263.90080MaRDI QIDQ4921255

No author found.

Publication date: 23 May 2013

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2012.00859.x

zbMATH Keywords

optimization; sphere; packing; polytope; mathematical modelling

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting, Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem, Packing circular-like objects in a rectangular container, Integer programming formulations for approximate packing circles in a rectangular container, Single-sized spheres on surfaces (S4)

Uses Software

• kepler98

Cites Work

• A literature review on circle and sphere packing problems: models and methodologies
• Tools of mathematical modeling of arbitrary object packing problems
• Packing cylinders and rectangular parallelepipeds with distances between them into a given region
• Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
• \(\Phi\)-functions for complex 2D-objects
• Packing of unequal spheres and automated radiosurgical treatment planning
• Minimizing the object dimensions in circle and sphere packing problems
• A proof of the Kepler conjecture
• On Numerical Issues of Interior Point Methods