Vertex quickest 1-center location problem on trees and its inverse problem under weighted l∞ norm

In view of some shortcomings of traditional vertex 1-center (V1C), we introduce a vertex quickest 1-center (VQ1C) problem on a tree, which aims to find a vertex such that the maximum transmission time to transmit σ units data is minimum. We first characterize some intrinsic properties of VQ1C and de...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of global optimization Ročník 85; číslo 2; s. 461 - 485
Hlavní autoři: Qian, Xinqiang, Guan, Xiucui, Jia, Junhua, Zhang, Qiao, Pardalos, Panos M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.02.2023
Springer Nature B.V
Témata:
Algorithms
Apexes
Communication
Communications networks
Computer Science
Inverse problems
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Real Functions
Search algorithms
Trees
Trees (mathematics)
Binary search
Tree
Strongly polynomial time algorithm
Vertex quickest 1-center problem
Inverse optimization problem
ISSN:0925-5001, 1573-2916
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In view of some shortcomings of traditional vertex 1-center (V1C), we introduce a vertex quickest 1-center (VQ1C) problem on a tree, which aims to find a vertex such that the maximum transmission time to transmit σ units data is minimum. We first characterize some intrinsic properties of VQ1C and design a binary search algorithm in O ( n log n ) time based on the relationship between V1C and VQ1C, where n is the number of vertices. Furthermore, we investigate the inverse VQ1C problem under weighted l ∞ norm, in which we modify a given capacity vector in an optimal way such that a prespecified vertex becomes the vertex quickest 1-center. We introduce a concept of an effective modification and provide some optimality conditions for the problem. Then we propose an O ( n 2 log n ) time algorithm. Finally, we show some numerical experiments to verify the efficiency of the algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-022-01212-5