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

Descripció completa

Dades bibliogràfiques

Autors principals:	Qiao Zhang, Xiao Li
Format:	Artigo
Idioma:	Inglês
Publicat:	MDPI AG 2025-10-01
Col·lecció:	Mathematics
Matèries:	network interdiction problem double interdiction problem upgrading edges shortest path tree weighted <i>l</i><sub>∞</sub> norm
Accés en línia:	https://www.mdpi.com/2227-7390/13/19/3219
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!