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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Miniball / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 21: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