Minisum location problem with farthest Euclidean distances (Q857948): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00186-006-0084-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2032560508 / rank | |||
Normal rank |
Revision as of 02:29, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minisum location problem with farthest Euclidean distances |
scientific article |
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