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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) / rank
 
Normal rank
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: Q2743973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the (Weighted) Minimum Circle Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weighted Euclidean 1-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147657 / rank
 
Normal rank

Latest revision as of 07:01, 6 July 2024

scientific article
Language Label Description Also known as
English
A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
scientific article

    Statements

    A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) (English)
    0 references
    0 references
    0 references
    11 March 2013
    0 references
    0 references
    minimum covering ball
    0 references
    min-max location
    0 references
    one-center location
    0 references
    nonlinear programming
    0 references
    0 references