Some zero-one linear programming reformulations for the maximum clique problem (Q4997639)
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 7364778
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some zero-one linear programming reformulations for the maximum clique problem |
scientific article; zbMATH DE number 7364778 |
Statements
Some Zero-One Linear Programming Reformulations for the Maximum Clique Problem (English)
0 references
29 June 2021
0 references
combinatorial optimization
0 references
maximum cliques
0 references
zero-one linear programming
0 references
greedy coloring
0 references
practical solutions of NP complete problems
0 references
0.7619754076004028
0 references
0.760109007358551
0 references
0.7599180936813354
0 references
0.7593310475349426
0 references
