Some Zero-One Linear Programming Reformulations for the Maximum Clique Problem (Q4997639)
From MaRDI portal
scientific article; zbMATH DE number 7364778
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
