Pages that link to "Item:Q5266487"
From MaRDI portal
The following pages link to Algorithms of optimal set covering on the planar R^2 (Q5266487):
Displaying 5 items.
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space (Q338040) (← links)
- Guaranteed deterministic approach to superhedging: sensitivity of solutions of the Bellman-Isaacs equations and numerical methods (Q830988) (← links)
- Algorithms of optimal ball packing into ellipsoids (Q5134235) (← links)
- (Q5153818) (← links)
- Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices (Q6169139) (← links)