Solving the Distance-Based Critical Node Problem (Q5087707)
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 7552209
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the Distance-Based Critical Node Problem |
scientific article; zbMATH DE number 7552209 |
Statements
Solving the Distance-Based Critical Node Problem (English)
0 references
1 July 2022
0 references
critical node
0 references
distance constraint
0 references
integer program
0 references
branch-and-cut
0 references
network interdiction
0 references
dominant
0 references
partial dominant
0 references
0 references
0 references
0 references
0.94515646
0 references
0 references
0.8938411
0 references
0.8886136
0 references
0.86984533
0 references
0.86965233
0 references
0 references
