Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569)
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: Branch and cut algorithms for detecting critical nodes in undirected graphs |
scientific article; zbMATH DE number 6137005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch and cut algorithms for detecting critical nodes in undirected graphs |
scientific article; zbMATH DE number 6137005 |
Statements
Branch and cut algorithms for detecting critical nodes in undirected graphs (English)
0 references
18 February 2013
0 references
critical node problem
0 references
branch and cut
0 references
valid inequalities
0 references
reformulation-linearization technique
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8337674736976624
0 references
0.8179076910018921
0 references
0.8072840571403503
0 references
0.7905781269073486
0 references
0.7896256446838379
0 references
