Packing spheres with quasi-containment conditions
From MaRDI portal
Publication:6631568
DOI10.1007/s10898-024-01412-1MaRDI QIDQ6631568
Tetyana Romanova, Georgiy Yaskov, Andreas Fischer, Petro I. Stetsyuk, I. S. Litvinchev
Publication date: 1 November 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
nonlinear programmingheuristicdecomposition techniquemixed-integer nonlinear programmingpacking spheresratio conditionopen dimension problemquasi-containmentnonstandard packing
Cites Work
- A literature review on circle and sphere packing problems: models and methodologies
- New approaches to circle packing in a square. With program codes.
- Solving the problem of packing equal and unequal circles in a circular container
- A local search-based method for sphere packing problems
- Integer programming formulations for approximate packing circles in a rectangular container
- A polyhedral branch-and-cut approach to global optimization
- Packing of unequal spheres and automated radiosurgical treatment planning
- Optimized packing multidimensional hyperspheres: a unified approach
- Improved interval methods for solving circle packing problems in the unit square
- Optimized filling of a given cuboid with spherical powders for additive manufacturing
- Packing ovals in optimized regular polygons
- Optimized ellipse packings in regular polygons
- Packing non-identical circles within a rectangle with open length
- Packing circles into perimeter-minimizing convex hulls
- Cutting and Packing Problems with Placement Constraints
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Decomposition Algorithm for Irregular Placement Problems
This page was built for publication: Packing spheres with quasi-containment conditions
