Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges

The double interdiction problem on trees (DIT) for the sum of root-leaf distances (SRD) has significant implications in diverse areas such as transportation networks, military strategies, and counter-terrorism efforts. It aims to maximize the SRD by upgrading edge weights subject to two constraints....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization Jg. 92; H. 4; S. 951 - 972
Hauptverfasser:	Li, Xiao, Guan, Xiucui, Jia, Junhua, Pardalos, Panos M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2025 Springer Nature B.V
Schlagworte:	Algorithms Complexity Computer Science Counterterrorism Dynamic programming Greedy algorithms Hardness Knapsack problem Lower bounds Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Real Functions Search algorithms Traffic congestion Transportation networks Trees Upper bounds Shortest path Upgrade critical edges Dynamic programming algorithm Sum of root-leaf distance Network interdiction 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!