Shortest path interdiction problem with convex piecewise-linear costs (Q6080429)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7745072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest path interdiction problem with convex piecewise-linear costs |
scientific article; zbMATH DE number 7745072 |
Statements
Shortest path interdiction problem with convex piecewise-linear costs (English)
0 references
2 October 2023
0 references
shortest path
0 references
network interdiction
0 references
Stackelberg game
0 references
continuous cost
0 references
minimum circulation problem
0 references
0 references
0 references
0 references
0.8615420460700989
0 references
0.8396781086921692
0 references
0.8185369372367859
0 references
0.8055181503295898
0 references
0.8045024275779724
0 references
