Detecting critical node structures on graphs: A mathematical programming approach (Q4628045)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Detecting critical node structures on graphs: A mathematical programming approach |
scientific article; zbMATH DE number 7032886
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Detecting critical node structures on graphs: A mathematical programming approach |
scientific article; zbMATH DE number 7032886 |
Statements
Detecting critical node structures on graphs: A mathematical programming approach (English)
0 references
6 March 2019
0 references
branch-price-and-cut
0 references
combinatorial optimization
0 references
critical node problem
0 references
graph partitioning
0 references
mixed-integer programming
0 references
network interdiction
0 references
0 references
0 references
0 references
0 references
0 references
