Language:

Vertex quickest 1-center location problem on trees and its inverse problem under weighted [Formula omitted] norm

Journal of global optimization, 2023-02, Vol.85 (2), p.461 [Peer Reviewed Journal]

Full text available

Citations Cited by

Title:
Vertex quickest 1-center location problem on trees and its inverse problem under weighted [Formula omitted] norm
Author: Qian, Xinqiang ; Guan, Xiucui ; Jia, Junhua ; Zhang, Qiao ; Pardalos, Panos M
Subjects: Algorithms
Is Part Of: Journal of global optimization, 2023-02, Vol.85 (2), p.461
Description: 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 [Formula omitted] units data is minimum. We first characterize some intrinsic properties of VQ1C and design a binary search algorithm in [Formula omitted] 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 [Formula omitted] 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 [Formula omitted] time algorithm. Finally, we show some numerical experiments to verify the efficiency of the algorithms.
Publisher: Springer
Language: English
Identifier: ISSN: 0925-5001
EISSN: 1573-2916
DOI: 10.1007/s10898-022-01212-5
Source: ProQuest Central

Back to results list


INSPIRE LIBRARY - TON DUC THANG UNIVERSITY	(84-028) 37 755 057	Feedback
19 Nguyen Huu Tho St. Dist.7, HCM	thuvien@tdtu.edu.vn	Feedback

Searching Remote Databases, Please Wait