Minimum-Cost Shortest-Path Interdiction Problem Involving Upgrading Edges on Trees with Weighted <i>l</i>_∞ Norm

Network interdiction problems involving edge deletion on shortest paths have wide applications. However, in many practical scenarios, the complete removal of edges is infeasible. The minimum-cost shortest-path interdiction problem for trees with the weighted <inline-formula><math xmlns="http://www.w...

Descrizione completa

Dettagli Bibliografici

Autori principali:	Qiao Zhang, Xiao Li
Natura:	Artigo
Lingua:	Inglês
Pubblicazione:	MDPI AG 2025-10-01
Serie:	Mathematics
Soggetti:	network interdiction problem double interdiction problem upgrading edges shortest path tree weighted <i>l</i><sub>∞</sub> norm
Accesso online:	https://www.mdpi.com/2227-7390/13/19/3219
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!