Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming (Q2288594)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming |
scientific article |
Statements
Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming (English)
0 references
20 January 2020
0 references
networks
0 references
robustness
0 references
graph theory
0 references
optimization problems
0 references
integer programming
0 references
0 references
0 references
0 references
