A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (Q833570)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A dual algorithm for the minimum covering ball problem in R^n |
scientific article; zbMATH DE number 5595307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) |
scientific article; zbMATH DE number 5595307 |
Statements
A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (English)
0 references
14 August 2009
0 references
minimum covering ball
0 references
one-center location
0 references
min-max location
0 references
0 references
0.876515805721283
0 references
0.855340838432312
0 references
0.8506278395652771
0 references
0.8358391523361206
0 references
0.8112258315086365
0 references
