Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm (Q2228388)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm |
scientific article |
Statements
Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm (English)
0 references
17 February 2021
0 references
blocker
0 references
shortest path
0 references
complexity
0 references
integer linear program
0 references
integral polytope
0 references
branch-and-cut
0 references
0 references
