The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486): 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/s10878-015-9907-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W360652485 / rank | |||
Normal rank | |||
Revision as of 00:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance |
scientific article |
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
