A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624)
From MaRDI portal
scientific article; zbMATH DE number 7584877
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem |
scientific article; zbMATH DE number 7584877 |
Statements
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (English)
0 references
14 September 2022
0 references
maximum clique problem
0 references
standard polynomial programming
0 references
Motzkin-Straus formulation
0 references
continuous approaches to discrete optimization
0 references
0 references
0 references
0 references
