A method of Euclidean centers (Q1906945): Difference between revisions

@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q5611526
@@ Property / cites work: Q5611526 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4016509
@@ Property / cites work: Q4016509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588268
@@ Property / cites work: Q5588268 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5540119
@@ Property / cites work: Q5540119 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3677502
@@ Property / cites work: Q3677502 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942388
@@ Property / cites work: Q4942388 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q3690974
@@ Property / cites work: Q3690974 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5566063
@@ Property / cites work: Q5566063 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514145
@@ Property / cites work: Q5514145 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the closest point to the origin in the convex hull of a discrete set of points
+Normal rank
@@ Property / cites work @@
+The Simplex Method for Quadratic Programming
@@ Property / cites work: The Simplex Method for Quadratic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Polytope pairs and their relationship to linear programming
+Normal rank