A polynomial time algorithm for solving the fermat-weber location problem with mixed norms (Q4764869)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 746321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for solving the fermat-weber location problem with mixed norms |
scientific article; zbMATH DE number 746321 |
Statements
A polynomial time algorithm for solving the fermat-weber location problem with mixed norms (English)
0 references
20 April 1995
0 references
subgradient
0 references
mixed norms
0 references
Fermat-Weber location problem
0 references
ellipsoid method
0 references
0.8502408266067505
0 references
0.8176041841506958
0 references
0.8137226104736328
0 references
0.8130396604537964
0 references
0.812167763710022
0 references
