An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance |
scientific article |
Statements
An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (English)
0 references
6 March 2023
0 references
network interdiction problem
0 references
upgrading critical edges
0 references
shortest path
0 references
dynamic programming algorithm
0 references
0 references
0 references
0 references
0 references
0 references
