Improved interval methods for solving circle packing problems in the unit square

DOI10.1007/s10898-021-01086-zzbMath1477.52026OpenAlexW3204182133MaRDI QIDQ2052392

Mihály Csaba Markót

Publication date: 26 November 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-021-01086-z

zbMATH Keywords

global optimizationbranch and boundcircle packinginterval arithmeticoptimality proof

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Circle packings and discrete conformal geometry (52C26)

Related Items (2)

Efficient algorithms for the dense packing of congruent circles inside a square ⋮ Techniques and results on approximation algorithms for packing circles

Uses Software

• C-XSC 2.0
• PROFIL/BIAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New approaches to circle packing in a square. With program codes.
• Densest packings of equal circles in a square
• An interval method to validate optimal solutions of the ``packing circles in a unit square problems
• Improving dense packings of equal disks in a square
• More optimal packings of equal circles in a square
• Repeated patterns of dense packings of equal disks in a square
• A reliable area reduction technique for solving circle packing problems
• Introduction to Interval Analysis
• Numerical Software with Result Verification
• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems

This page was built for publication: Improved interval methods for solving circle packing problems in the unit square