A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072)
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 7356517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the edge interdiction clique problem |
scientific article; zbMATH DE number 7356517 |
Statements
A branch-and-cut algorithm for the edge interdiction clique problem (English)
0 references
8 June 2021
0 references
combinatorial optimization
0 references
interdiction problems
0 references
maximum clique
0 references
most vital edges
0 references
0 references
0.8407120108604431
0 references
0.7979696393013
0 references
0.7584608197212219
0 references
0.7563192844390869
0 references
0.7512003779411316
0 references
