A new global algorithm for max-cut problem with chordal sparsity (Q6103705)
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 7702984
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new global algorithm for max-cut problem with chordal sparsity |
scientific article; zbMATH DE number 7702984 |
Statements
A new global algorithm for max-cut problem with chordal sparsity (English)
0 references
27 June 2023
0 references
max-cut
0 references
branch-and-bound
0 references
sparsity pattern
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8069446086883545
0 references
0.7943546175956726
0 references
0.7731224894523621
0 references
0.7719125151634216
0 references
0.7676326036453247
0 references
