Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximum shortest path interdiction problem by upgrading edges on trees under weighted lā norm |
scientific article; zbMATH DE number 7340882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm |
scientific article; zbMATH DE number 7340882 |
Statements
Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (English)
0 references
28 April 2021
0 references
network interdiction problem
0 references
upgrading critical edges
0 references
shortest path
0 references
weighted \(l_1\) norm
0 references
primal dual algorithm
0 references
minimum cost cut
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9187227487564088
0 references
0.8820578455924988
0 references
0.7994261980056763
0 references
0.7993884682655334
0 references
0.7821000218391418
0 references
