Packing equal circles in a square: A deterministic global optimization approach
From MaRDI portal
Publication:1613419
DOI10.1016/S0166-218X(01)00359-6zbMath1019.90033MaRDI QIDQ1613419
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
90C27: Combinatorial optimization
Related Items
Efficient Approximations for the Online Dispersion Problem, Clustering methods for large scale geometrical global optimization, Uniformity of Point Samples in Metric Spaces Using Gap Ratio, Differential evolution methods based on local searches, Packing, covering and tiling in two-dimensional spaces, A literature review on circle and sphere packing problems: models and methodologies, Greedy vacancy search algorithm for packing equal circles in a square, A heuristic approach for packing identical rectangles in convex regions, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, Approximate solutions of continuous dispersion problems, Efficiently packing unequal disks in a circle, Solving circle packing problems by global optimization: numerical results and industrial applications, Solving the problem of packing equal and unequal circles in a circular container, Packing equal circles in a square: A deterministic global optimization approach, Split packing: algorithms for packing circles with optimal worst-case density, Time-optimal velocity planning by a bound-tightening technique, Statistical inference for disordered sphere packings, Global optimization problems and domain reduction strategies, On the problem of packing spheres in a cube, Linear models for the approximate solution of the problem of packing equal circles into a given domain, Space-filling Latin hypercube designs for computer experiments, Valid constraints for the Point Packing in a Square problem, Packing unequal circles into a strip of minimal length with a jump algorithm, Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors, Minimizing the object dimensions in circle and sphere packing problems, A reliable area reduction technique for solving circle packing problems, New and improved results for packing identical unitary radius circles within triangles, rectangles and strips, Unnamed Item, Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain, Uniformity of Point Samples in Metric Spaces Using Gap Ratio, A bi-objective guillotine cutting problem of stamping strips of equal circles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Die dichteste Packung von 14 Kreisen in einem Quadrat. (On the densest packing of fourteen circles in a square)
- Die dichteste Packung von 36 Kreisen in einem Quadrat. (On the denest packing of 36 circles in a square)
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
- Packing up to 50 equal circles in a square
- Covering a rectangle with equal circles
- Improving dense packings of equal disks in a square
- Packing equal circles in a square: A deterministic global optimization approach
- More optimal packings of equal circles in a square
- A relaxation method for nonconvex quadratically constrained quadratic programs
- New results in the packing of equal circles in a square
- On a Geometric Extremum Problem
- The Densest Packing of 9 Circles in a Square
- The Packing of Equal Circles in a Square
