Pages that link to "Item:Q855072"

The following pages link to New approaches to circle packing in a square. With program codes. (Q855072):

Displaying 47 items.

• Covering part of a planar network (Q291695) (← links)
• A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
• Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
• Differential evolution methods based on local searches (Q336908) (← links)
• On Malfatti's marble problem (Q338645) (← links)
• High density packings of equal circles in rectangles with variable aspect ratio (Q339540) (← links)
• Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
• Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← links)
• Global optimization method for finding dense packings of equal circles in a circle (Q541690) (← links)
• A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
• Greedy vacancy search algorithm for packing equal circles in a square (Q613329) (← links)
• A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
• A heuristic for the circle packing problem with a variety of containers (Q635155) (← links)
• The GLOBAL optimization method revisited (Q941038) (← links)
• Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
• Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
• Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium (Q1618475) (← links)
• On optimal piercing of a square (Q1671340) (← links)
• Split packing: algorithms for packing circles with optimal worst-case density (Q1731458) (← links)
• Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study (Q1749785) (← links)
• Cooperative cover of uniform demand (Q2005869) (← links)
• Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
• Improved interval methods for solving circle packing problems in the unit square (Q2052392) (← links)
• Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
• Packing ovals in optimized regular polygons (Q2173521) (← links)
• On limits of dense packing of equal spheres in a cube (Q2256132) (← links)
• On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container (Q2299015) (← links)
• Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
• Optimized ellipse packings in regular polygons (Q2329677) (← links)
• Linear models for the approximate solution of the problem of packing equal circles into a given domain (Q2356022) (← links)
• Interval unions (Q2359762) (← links)
• Evolutionary computation solutions to the circle packing problem (Q2402110) (← links)
• Packings of equal disks in a square torus (Q2411825) (← links)
• Rigorous packing of unit squares into a circle (Q2416578) (← links)
• Online circle and sphere packing (Q2419121) (← links)
• Valid constraints for the Point Packing in a Square problem (Q2446880) (← links)
• Packing unequal circles into a strip of minimal length with a jump algorithm (Q2448172) (← links)
• Review of obnoxious facilities location problems (Q2669654) (← links)
• Packing disks into disks with optimal worst-case density (Q2679596) (← links)
• Model development and solver demonstrations using randomized test problems (Q2689552) (← links)
• Packing Unit Spheres into a Cube Using VNS (Q2840774) (← links)
• Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain (Q2940410) (← links)
• (Q5088965) (← links)
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) (Q5088996) (← links)
• Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming (Q6090468) (← links)
• Efficient algorithms for the dense packing of congruent circles inside a square (Q6156095) (← links)
• Iterated dynamic neighborhood search for packing equal circles on a sphere (Q6164321) (← links)