Pages that link to "Item:Q1613419"

The following pages link to Packing equal circles in a square: A deterministic global optimization approach (Q1613419):

Displaying 50 items.

• On the global minimum in a balanced circular packing problem (Q315515) (← links)
• Differential evolution methods based on local searches (Q336908) (← links)
• Quasi-physical global optimization method for solving the equal circle packing problem (Q350865) (← links)
• Packing, covering and tiling in two-dimensional spaces (Q472930) (← 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)
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
• Approximate solutions of continuous dispersion problems (Q816409) (← links)
• New approaches to circle packing in a square. With program codes. (Q855072) (← links)
• Efficiently packing unequal disks in a circle (Q924882) (← links)
• Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
• Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
• Packing equal circles in a square: A deterministic global optimization approach (Q1613419) (← links)
• A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
• Split packing: algorithms for packing circles with optimal worst-case density (Q1731458) (← links)
• Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
• On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square (Q1759867) (← links)
• Statistical inference for disordered sphere packings (Q1951652) (← links)
• Global optimization problems and domain reduction strategies (Q1960192) (← links)
• The exact solution of multiparametric quadratically constrained quadratic programming problems (Q2022221) (← links)
• On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
• Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
• On the problem of packing spheres in a cube (Q2263331) (← links)
• Linear models for the approximate solution of the problem of packing equal circles into a given domain (Q2356022) (← links)
• Optimal packing of 28 equal circles in a unit square -- the first reliable solution (Q2387771) (← links)
• Space-filling Latin hypercube designs for computer experiments (Q2443402) (← 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)
• Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors (Q2460106) (← links)
• Minimizing the object dimensions in circle and sphere packing problems (Q2468491) (← links)
• A reliable area reduction technique for solving circle packing problems (Q2492666) (← links)
• New and improved results for packing identical unitary radius circles within triangles, rectangles and strips (Q2655648) (← links)
• Review of obnoxious facilities location problems (Q2669654) (← links)
• Formulation symmetries in circle packing (Q2861569) (← links)
• Disk packing in a square: a new global optimization approach (Q2901032) (← links)
• Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain (Q2940410) (← links)
• Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q2948479) (← links)
• A bi-objective guillotine cutting problem of stamping strips of equal circles (Q3056407) (← links)
• On existence of integral point sets and their diameter bounds (Q3300691) (← links)
• (Q3640390) (← links)
• Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
• Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary (Q5090167) (← links)
• Clustering methods for large scale geometrical global optimization (Q5198058) (← links)
• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems (Q5317555) (← links)
• Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q5361233) (← links)
• Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming (Q6090468) (← links)
• Spreading points using gradient and tabu (Q6097431) (← links)
• The repeated <i>p</i>-dispersion problem (Q6155626) (← links)