A polynomial time dual algorithm for the Euclidean multifacility location problem (Q1919190): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 12:52, 24 May 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
23 February 1997
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
