A new global algorithm for max-cut problem with chordal sparsity (Q6103705): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10957-023-02195-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4360998224 / rank | |||
Normal rank | |||
Revision as of 10:54, 30 July 2024
scientific article; zbMATH DE number 7702984
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
