A method of Euclidean centers
From MaRDI portal
Recommendations
- A version of the parameterized method of centers
- Euclidean centers: Computation, properties and a MOLP application
- A geometric centroid principle and its application
- Some properties of methods of centers
- Weighted Euclidean centers
- The center problem via averaging method
- The optimality of the centroid method
- scientific article; zbMATH DE number 4102820
Cites work
- scientific article; zbMATH DE number 3898606 (Why is no real title available?)
- scientific article; zbMATH DE number 3915531 (Why is no real title available?)
- scientific article; zbMATH DE number 88933 (Why is no real title available?)
- scientific article; zbMATH DE number 1419375 (Why is no real title available?)
- scientific article; zbMATH DE number 3225772 (Why is no real title available?)
- scientific article; zbMATH DE number 3253619 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3333881 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- Convex Analysis
- Finding the closest point to the origin in the convex hull of a discrete set of points
- Polytope pairs and their relationship to linear programming
- The Simplex Method for Quadratic Programming
Cited in
(7)- Weighted Euclidean centers
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems
- Centerpoints and Tverberg's technique
- The center problem via averaging method
- Robust centroid method
- Interval judgments and Euclidean centers
- Euclidean centers: Computation, properties and a MOLP application
This page was built for publication: A method of Euclidean centers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906945)