Numerical experiments with LP formulations of the maximum clique problem (Q2103941): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10100-021-00776-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10100-021-00776-Z / rank | |||
Normal rank | |||
Latest revision as of 01:52, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical experiments with LP formulations of the maximum clique problem |
scientific article |
Statements
Numerical experiments with LP formulations of the maximum clique problem (English)
0 references
9 December 2022
0 references
combinatorial optimization
0 references
maximum clique problem
0 references
zero-one linear programming
0 references
greedy coloring
0 references
practical solutions of NP complete problems
0 references
LP relaxation bounds
0 references
