A polynomial time dual algorithm for the Euclidean multifacility location problem (Q1919190): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of a multifacility location problem involving euclidian distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the method of analytic centers when applied to convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(95)00050-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003428163 / rank
 
Normal rank

Latest revision as of 10:25, 30 July 2024

scientific article
Language Label Description Also known as
English
A polynomial time dual algorithm for the Euclidean multifacility location problem
scientific article

    Statements

    A polynomial time dual algorithm for the Euclidean multifacility location problem (English)
    0 references
    0 references
    0 references
    0 references
    23 February 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial time algorithm
    0 references
    self-concordant barrier
    0 references
    Euclidean multifacility location
    0 references
    interior point methods
    0 references
    duality gap
    0 references
    0 references