A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (Q833570): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4945505 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Minimum Covering Sphere Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms - ESA 2003 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for the smallest enclosing ball problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient, exact, and generic quadratic programming solver for geometric optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3147657 / rank | |||
Normal rank | |||
Revision as of 20:49, 1 July 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
0 references
