A dual algorithm for the minimum covering ball problem in $\mathbb R^n$ (Q833570): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2009.02.008
@@ Property / DOI: 10.1016/j.orl.2009.02.008 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2009.02.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1971823973
@@ Property / OpenAlex ID: W1971823973 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945505
@@ Property / cites work: Q4945505 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
+Normal rank
@@ Property / cites work @@
+The Minimum Covering Sphere Problem
@@ Property / cites work: The Minimum Covering Sphere Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the smallest enclosing ball problem
+Normal rank
@@ Property / cites work @@
+An efficient, exact, and generic quadratic programming solver for geometric optimization
+Normal rank
@@ Property / cites work @@
+Linear Programming in Linear Time When the Dimension Is Fixed
+Normal rank
@@ Property / cites work @@
+Q3147657
@@ Property / cites work: Q3147657 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2009.02.008
@@ Property / DOI: 10.1016/J.ORL.2009.02.008 / rank @@
+Normal rank

A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (Q833570): Difference between revisions