The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance |
scientific article; zbMATH DE number 6637638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance |
scientific article; zbMATH DE number 6637638 |
Statements
The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (English)
0 references
12 October 2016
0 references
location problem
0 references
inverse optimization
0 references
1-center problem
0 references
tree
0 references
0 references
0 references
0.9218208
0 references
0.9110813
0 references
0.9107758
0 references
0.9071636
0 references
0.9006901
0 references
0.8944893
0 references
0.8853041
0 references
0.88333285
0 references
0.8828611
0 references
