Pages that link to "Item:Q1962064"
From MaRDI portal
The following pages link to Covering a rectangle with six and seven circles (Q1962064):
Displaying 15 items.
- Geometric partitioning and robust ad-hoc network design (Q271922) (← links)
- Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
- Covering a compact polygonal set by identical circles (Q969729) (← links)
- Algorithms for constructing optimal \(n\)-networks in metric spaces (Q1675840) (← links)
- Global exact optimization for covering a rectangle with 6 circles (Q2131145) (← links)
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048) (← links)
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem (Q2301011) (← links)
- Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set (Q2332657) (← links)
- Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles (Q2743873) (← links)
- On reserve and double covering problems for the sets with non-Euclidean metrics (Q3388412) (← links)
- AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS (Q4650086) (← links)
- On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains (Q4973240) (← links)
- (Q5206912) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q5361233) (← links)
- Worst-case optimal covering of rectangles by disks (Q6624196) (← links)
