Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672)
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 7868436
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reformulations and complexity of the clique interdiction problem by graph mapping |
scientific article; zbMATH DE number 7868436 |
Statements
Reformulations and complexity of the clique interdiction problem by graph mapping (English)
0 references
20 June 2024
0 references
maximum clique
0 references
bilevel programming
0 references
edge clique interdiction
0 references
node clique interdiction
0 references
complexity
0 references
single level reformulation
0 references
facets
0 references
0 references
0.7818225622177124
0 references
0.7779509425163269
0 references
0.7071112990379333
0 references
0.7070014476776123
0 references
0.702315092086792
0 references