The following pages link to (Q4002851):
Displaying 5 items.
- Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\) (Q269155) (← links)
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space (Q338040) (← links)
- On segmenting logistical zones for servicing continuously developed consumers (Q462009) (← links)
- Hausdorff methods for approximating the convex Edgeworth-Pareto hull in integer problems with monotone objectives (Q519662) (← links)
- Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema (Q5139113) (← links)
