Packing circles into perimeter-minimizing convex hulls
DOI10.1007/s10898-018-0724-0zbMath1422.90045OpenAlexW2903154912WikidataQ128825195 ScholiaQ128825195MaRDI QIDQ2423783
Josef Kallrath, Markus M. Frey
Publication date: 20 June 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0724-0
global optimizationisoperimetric inequalityconvex hullcomputational geometrynon-convex nonlinear programmingnon-overlap constraintsperimeter minimizationcircular packing problem
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the global minimum in a balanced circular packing problem
- Lectures on sphere arrangements -- the discrete geometric side
- Packing congruent hyperspheres into a hypersphere
- Packing ellipsoids into volume-minimizing rectangular boxes
- Polylithic modeling and solution approaches using algebraic modeling systems
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Cutting circles and polygons from area-minimizing rectangles
- A convex hull algorithm for discs, and applications
- The convex hull of two circles in \(\mathbb{R}^3\)
- A typology of cutting and packing problems
- A simulated annealing approach for the circular cutting problem
- Optimal clustering of a pair of irregular objects
- Aligning two convex figures to minimize area or perimeter
- Packing unequal circles into a strip of minimal length with a jump algorithm
- Adaptive and restarting techniques-based algorithms for circular packing problems
This page was built for publication: Packing circles into perimeter-minimizing convex hulls
