The following pages link to (Q4002851):
Displaying 13 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)
- Model building and location problem solving in a plane with forbidden gaps (Q885785) (← links)
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations (Q891710) (← links)
- Solving a maximin location problem on the plane with given accuracy (Q893922) (← links)
- Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas (Q1735326) (← links)
- A position-situation approach to regularization of mappings of geometrical information (Q1816374) (← links)
- Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones (Q1930700) (← links)
- Recursion and parallel algorithms in geometric modeling problems (Q1956990) (← links)
- Algebraic approach to the problem of solving systems of linear inequalities (Q1957004) (← links)
- Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema (Q5139113) (← links)
