Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems (Q6371068)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems |
scientific article; zbMATH DE number 900484169
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems |
scientific article; zbMATH DE number 900484169 |
Statements
23 June 2021
0 references
math.OC
0 references
