Separating clique tree and bipartition inequalities in polynomial time (Q5101404)
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 7577880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separating clique tree and bipartition inequalities in polynomial time |
scientific article; zbMATH DE number 7577880 |
Statements
Separating clique tree and bipartition inequalities in polynomial time (English)
0 references
30 August 2022
0 references
0.9881142377853394
0 references
0.8460942506790161
0 references
0.8324791789054871
0 references
0.830314040184021
0 references
0.830314040184021
0 references
