Abstract
We are dealing with the optimal, i.e., densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method using interval arithmetic computations, which can be regarded as a "computer-assisted proof". An efficient algorithm has been published earlier for eliminating large sets of suboptimal points of the equivalent point packing problem. The present paper discusses an interval arithmetic based version of this tool, implemented as an accelerating device of an interval branch-and-bound optimization algorithm. In order to satisfy the rigorous requirements of a computational proof, a detailed algorithmic description and a proof of correctness are provided. This elimination method played a key role in solving the previously open problem instances of packing 28, 29, and 30 circles.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
