A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (Q833570): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2009.02.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971823973 / rank | |||
Normal rank | |||
Revision as of 22:22, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) |
scientific article |
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
