Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150)
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 7175946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances |
scientific article; zbMATH DE number 7175946 |
Statements
Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (English)
0 references
28 February 2020
0 references
facility location
0 references
min-max problem
0 references
second order cone programming
0 references
Minkowski sum
0 references
regional customer
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8351756930351257
0 references
0.8113996982574463
0 references
0.8092326521873474
0 references
0.8058601021766663
0 references
0.7951735854148865
0 references
