Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092)
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 6994284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for the minimum cost vertex blocker clique problem |
scientific article; zbMATH DE number 6994284 |
Statements
Exact algorithms for the minimum cost vertex blocker clique problem (English)
0 references
17 December 2018
0 references
minimum cost vertex blocker clique problem
0 references
interdiction
0 references
lazy-fashioned branch-and-cut
0 references
combinatorial branch-and-bound
0 references
0 references
0 references
0 references
0 references
0.91862464
0 references
0.9026979
0 references
0.9026979
0 references
0.8918227
0 references
0.8853998
0 references
0.8821045
0 references
0.87762773
0 references
