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

DOI10.1007/S10898-021-01086-ZMaRDI QIDQ2052392zbMATH OpenOpenAlexFDO

Authors Mihály Csaba Markót

Publication date 26 November 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

branch and boundcircle packingglobal optimizationinterval arithmeticoptimality proof

Mathematics Subject Classification ID

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

Recommendations

• A reliable area reduction technique for solving circle packing problems
• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
• An interval method to validate optimal solutions of the ``packing circles in a unit square problems
• scientific article; zbMATH DE number 1748533
• Interval methods for verifying structural optimality of circle packing configurations in the unit square

Cites work

• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
• A reliable area reduction technique for solving circle packing problems
• An interval method to validate optimal solutions of the ``packing circles in a unit square problems
• Densest packings of equal circles in a square
• scientific article; zbMATH DE number 432979 (Why is no real title available?)
• scientific article; zbMATH DE number 54095 (Why is no real title available?)
• scientific article; zbMATH DE number 193463 (Why is no real title available?)
• Improving dense packings of equal disks in a square
• Introduction to Interval Analysis
• More optimal packings of equal circles in a square
• New approaches to circle packing in a square. With program codes.
• Numerical Software with Result Verification
• Repeated patterns of dense packings of equal disks in a square

Cited in

(12)

• An interval method to validate optimal solutions of the ``packing circles in a unit square problems
• On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
• Techniques and results on approximation algorithms for packing circles
• Rigorous packing of unit squares into a circle
• A reliable area reduction technique for solving circle packing problems
• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
• Efficient algorithms for the dense packing of congruent circles inside a square
• Packing spheres with quasi-containment conditions
• A heuristic algorithm with multi-scale perturbations for point arrangement and equal circle packing in a convex container
• New approaches to circle packing in a square. With program codes.
• Interval methods for verifying structural optimality of circle packing configurations in the unit square
• Solving circle packing problems by global optimization: numerical results and industrial applications

Describes a project that uses

Uses Software

• PROFIL/BIAS
• C-XSC 2.0

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052392)