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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of global optimization Ročník 92; číslo 4; s. 951 - 972
Hlavní autoři:	Li, Xiao, Guan, Xiucui, Jia, Junhua, Pardalos, Panos M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.08.2025 Springer Nature B.V
Témata:	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
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!

Buďte první, kdo okomentuje tento záznam!