Pages that link to "Item:Q635155"

The following pages link to A heuristic for the circle packing problem with a variety of containers (Q635155):

Displaying 28 items.

• A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
• Differential evolution methods based on local searches (Q336908) (← links)
• High density packings of equal circles in rectangles with variable aspect ratio (Q339540) (← links)
• Packing circular-like objects in a rectangular container (Q499146) (← links)
• Quasi-human seniority-order algorithm for unequal circles packing (Q528450) (← links)
• Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium (Q1618475) (← links)
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
• Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) (← links)
• Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
• Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
• On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
• Repulsion-based p-dispersion with distance constraints in non-convex polygons (Q2070713) (← links)
• Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
• A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints (Q2157560) (← links)
• Packing ovals in optimized regular polygons (Q2173521) (← links)
• Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches (Q2184044) (← links)
• Phase field approach to optimal packing problems and related Cheeger clusters (Q2301677) (← links)
• Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
• Dense packing of congruent circles in free-form non-convex containers (Q2357688) (← links)
• A note on solving MINLP's using formulation space search (Q2448189) (← links)
• Review of obnoxious facilities location problems (Q2669654) (← links)
• Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) (← links)
• Packing equal circles into a circle with circular prohibited areas (Q4903496) (← links)
• Clustering methods for large scale geometrical global optimization (Q5198058) (← links)
• Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming (Q6090468) (← links)
• The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices (Q6113351) (← links)
• Iterated dynamic neighborhood search for packing equal circles on a sphere (Q6164321) (← links)
• Different formulations of the gray pattern problem and their optimal solutions (Q6586256) (← links)