Minisum location problem with farthest Euclidean distances (Q857948)
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 5082019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minisum location problem with farthest Euclidean distances |
scientific article; zbMATH DE number 5082019 |
Statements
Minisum location problem with farthest Euclidean distances (English)
0 references
5 January 2007
0 references
constrained Weber problem
0 references
fixed region
0 references
bound test
0 references
greedy choice
0 references
choice of starting point
0 references
0.9710148
0 references
0.9570802
0 references
0.92766833
0 references
0.9264453
0 references
0.9197737
0 references
0.9109558
0 references
0 references
0.8892286
0 references
0.8884189
0 references
