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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization Jg. 85; H. 2; S. 461 - 485
Hauptverfasser:	Qian, Xinqiang, Guan, Xiucui, Jia, Junhua, Zhang, Qiao, Pardalos, Panos M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.02.2023 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!