Pages that link to "Item:Q932199"

The following pages link to Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199):

Displaying 23 items.

• Packing disks into disks with optimal worst-case density (Q2679596) (← links)
• Model development and solver demonstrations using randomized test problems (Q2689552) (← links)
• Recursive circle packing problems (Q2803272) (← links)
• Covering a convex 3D polytope by a minimal number of congruent spheres (Q2931942) (← links)
• Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain (Q2940410) (← links)
• Packing Problems in Space Solved by CPLEX: An Experimental Analysis (Q3133910) (← links)
• Global Optimization in Practice:State of the Art and Perspectives (Q3565460) (← links)
• Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
• Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) (← links)
• Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem (Q4634982) (← links)
• A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
• Packing equal circles into a circle with circular prohibited areas (Q4903496) (← links)
• Packing circles within ellipses (Q4924059) (← links)
• A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure (Q5023088) (← links)
• (Q5088965) (← links)
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) (Q5088996) (← links)
• Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary (Q5090167) (← links)
• Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives (Q5270058) (← links)
• Spreading points using gradient and tabu (Q6097431) (← links)
• Iterated dynamic neighborhood search for packing equal circles on a sphere (Q6164321) (← links)
• A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools (Q6492453) (← links)
• A filtered beam search based heuristic algorithm for packing unit circles into a circular container (Q6568430) (← links)
• (Re)packing equal disks into rectangle (Q6642301) (← links)