A minisum location problem with regional demand considering farthest Euclidean distances (Q2815539)
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 6599530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A minisum location problem with regional demand considering farthest Euclidean distances |
scientific article; zbMATH DE number 6599530 |
Statements
A minisum location problem with regional demand considering farthest Euclidean distances (English)
0 references
29 June 2016
0 references
facility location problem
0 references
demand region
0 references
minisum problem
0 references
second-order cone programming
0 references
0 references
0 references
0.9210009
0 references
0.9197737
0 references
0 references
0.8939721
0 references
0.8933288
0 references
0.8888423
0 references
0.88881826
0 references
0.88752615
0 references
0.87982476
0 references
