New approaches to circle packing in a square. With program codes.
From MaRDI portal
Publication:855072
zbMATH Open1128.52012MaRDI QIDQ855072FDOQ855072
Tibor Csendes, Péter Gábor Szabó, E. Specht, Mihály Csaba Markót, I. García, L. G. Casado
Publication date: 27 December 2006
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 432979
- Efficient algorithms for the dense packing of congruent circles inside a square
- Some new structures for the ``equal circles packing in a square problem
- New results in the packing of equal circles in a square
- Some progress in the packing of equal circles in a square
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Improved interval methods for solving circle packing problems in the unit square
- scientific article; zbMATH DE number 1748532
- Packing equal circles in a square: A deterministic global optimization approach
- scientific article; zbMATH DE number 1748533
Nonlinear programming (90C30) Computational aspects related to convexity (52B55) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Circle packings and discrete conformal geometry (52C26)
Cited In (57)
- Different formulations of the gray pattern problem and their optimal solutions
- The concept of modeling packing and covering problems using modern computational geometry software
- Packing spheres with quasi-containment conditions
- (Re)packing equal disks into rectangle
- The repeated p-dispersion problem
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Title not available (Why is that?)
- Geometric Packing under Nonuniform Constraints
- Split packing: algorithms for packing circles with optimal worst-case density
- Valid constraints for the Point Packing in a Square problem
- Cooperative cover of uniform demand
- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- Optimized ellipse packings in regular polygons
- Iterated dynamic neighborhood search for packing equal circles on a sphere
- Interval unions
- Efficient algorithms for the dense packing of congruent circles inside a square
- Clustering methods for large scale geometrical global optimization
- Covering part of a planar network
- Packings of equal disks in a square torus
- On optimal piercing of a square
- Adaptive large neighborhood search for solving the circle bin packing problem
- On limits of dense packing of equal spheres in a cube
- Review of obnoxious facilities location problems
- Cutting circles and polygons from area-minimizing rectangles
- Global optimization method for finding dense packings of equal circles in a circle
- Optimal substructures in optimal and approximate circle packings
- Improved interval methods for solving circle packing problems in the unit square
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- A literature review on circle and sphere packing problems: models and methodologies
- Polynomial-time approximation schemes for circle and other packing problems
- Greedy vacancy search algorithm for packing equal circles in a square
- Differential evolution methods based on local searches
- On Malfatti's marble problem
- High density packings of equal circles in rectangles with variable aspect ratio
- A heuristic for the circle packing problem with a variety of containers
- Packing unit spheres into a cube using VNS
- Packing disks into disks with optimal worst-case density
- The GLOBAL optimization method revisited
- Solving the problem of packing equal and unequal circles in a circular container
- Evolutionary computation solutions to the circle packing problem
- Packing ovals in optimized regular polygons
- Exact algorithms for the solution of the grey pattern quadratic assignment problem
- Model development and solver demonstrations using randomized test problems
- On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
- Reformulation descent applied to circle packing problems
- Techniques and results on approximation algorithms for packing circles
- Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
- Sequential location of two facilities: comparing random to optimal location of the first facility
- Rigorous packing of unit squares into a circle
- A bounded space algorithm for online circle packing
- Online circle and sphere packing
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
- A heuristic approach for packing identical rectangles in convex regions
- Packing unequal circles into a strip of minimal length with a jump algorithm
Uses Software
This page was built for publication: New approaches to circle packing in a square. With program codes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855072)
