Pages that link to "Item:Q1921619"
From MaRDI portal
The following pages link to Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses (Q1921619):
Displaying 10 items.
- Optimal covering of plane domains by circles via hyperbolic smoothing (Q813342) (← links)
- Optimal coverage of convex regions (Q1068722) (← links)
- Covering the plane with fat ellipses without non-crossing assumption (Q1404516) (← links)
- Covering with ellipses (Q1889588) (← links)
- Covering problems with polyellipsoids: a location analysis perspective (Q2028797) (← links)
- New exact algorithms for planar maximum covering location by ellipses problems (Q2029953) (← links)
- A computationally inexpensive algorithm for determining outer and inner enclosures of nonlinear mappings of ellipsoidal domains (Q2057959) (← links)
- Deterministic and stochastic global optimization techniques for planar covering with ellipses problems (Q2253403) (← links)
- Various modifications of optimum algorithm of construction of the minimal area ellipse (Q2745052) (← links)
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain (Q2940410) (← links)