Pages that link to "Item:Q2356022"
From MaRDI portal
The following pages link to Linear models for the approximate solution of the problem of packing equal circles into a given domain (Q2356022):
Displaying 13 items.
- Packing circular-like objects in a rectangular container (Q499146) (← links)
- Numerical optimization method for packing regular convex polygons (Q519665) (← 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)
- Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) (← links)
- Optimized packing multidimensional hyperspheres: a unified approach (Q1979535) (← 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)
- Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set (Q2332657) (← links)
- Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) (← links)
- On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains (Q4973240) (← links)
- Proportional packing of circles in a circular container (Q6160555) (← links)
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container (Q6568430) (← links)
