Solving convex location problems with gauges in polynomial time (Q2708113)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving convex location problems with gauges in polynomial time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving convex location problems with gauges in polynomial time |
scientific article |
Statements
16 December 2001
0 references
multifacility location
0 references
continuous location
0 references
barrier method
0 references
0.8626562
0 references
0.85778254
0 references
0.85547197
0 references
0 references
0.85220665
0 references
Solving convex location problems with gauges in polynomial time (English)
0 references
Continuous multifacility location problems involve the minimisation of a sum of interfacility distances among existing and new points in \(\mathbb{R}^d\). This is extended here to minimizing a convex quadratic function of distances (and possibly maxima of subsets of these distances), as measured by possibly different gauges. An interior point method is developed yielding an \(\varepsilon\)-optimal solution in polynomial time.
0 references
