Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm (Q2687446): 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/s10898-022-01212-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4285676817 / rank | |||
Normal rank | |||
Revision as of 19:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm |
scientific article |
Statements
Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm (English)
0 references
2 March 2023
0 references
vertex quickest 1-center problem
0 references
tree
0 references
binary search
0 references
inverse optimization problem
0 references
strongly polynomial time algorithm
0 references
