Pages that link to "Item:Q5288735"
From MaRDI portal
The following pages link to A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (Q5288735):
Displaying 16 items.
- Clipping algorithms for solving the nearest point problem over reduced convex hulls (Q621999) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- Zonotopes and the LP-Newton method (Q833464) (← links)
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes (Q1315417) (← links)
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950) (← links)
- Finding a best approximation pair of points for two polyhedra (Q1616942) (← links)
- Efficient computation of dual space and directional multiplicity of an isolated point (Q1634816) (← links)
- A simple projection algorithm for linear programming problems (Q1755785) (← links)
- A note concerning the closest point pair algorithm. (Q1853012) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Two-dimensional closest pair problem: a closer look (Q2004080) (← links)
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions (Q2459569) (← links)
- A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE (Q3197625) (← links)
- Algorithms and Computation (Q5712142) (← links)
