Rigorous packing of unit squares into a circle
From MaRDI portal
Publication:2416578
DOI10.1007/s10898-018-0711-5zbMath1415.52012WikidataQ64884173 ScholiaQ64884173MaRDI QIDQ2416578
Mihály Csaba Markót, Ferenc Domes, Tiago Montanher, Arnold Neumaier, Hermann Schichl
Publication date: 23 May 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0711-5
computer-assisted proof; interval branch-and-bound; square packing into a circle; tiling constraints
65K05: Numerical mathematical programming methods
90C26: Nonconvex programming, global optimization
65G30: Interval and finite arithmetic
52C15: Packing and covering in (2) dimensions (aspects of discrete geometry)
Uses Software
Cites Work
- Unnamed Item
- Packing ellipsoids by nonlinear optimization
- Interval analysis on directed acyclic graphs for global optimization
- 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
- Packing equal squares into a large square
- On packing squares with equal squares
- Rigorous global search: continuous problems
- Packing unit squares in squares: A survey and new results
- Packing 10 or 11 unit squares in a square
- Optimal packings of 13 and 46 unit squares in a square
- Rigorous verification of feasibility
- Cutting ellipses from area-minimizing rectangles
- A nonlinear programming model with implicit variables for packing ellipsoids
- Packing unit squares in a rectangle
- Method of sentinels for packing items within arbitrary convex regions
- FILIB++, a fast interval library supporting containment computations
- Interval Methods for Systems of Equations
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Using sentinels to detect intersections of convex and nonconvex polygons
