Numerical experiments with LP formulations of the maximum clique problem (Q2103941): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:01, 1 February 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
