New heuristics for the vertex coloring problem based on semidefinite programming (Q351547)
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: New heuristics for the vertex coloring problem based on semidefinite programming |
scientific article; zbMATH DE number 6185058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New heuristics for the vertex coloring problem based on semidefinite programming |
scientific article; zbMATH DE number 6185058 |
Statements
New heuristics for the vertex coloring problem based on semidefinite programming (English)
0 references
8 July 2013
0 references
semidefinite programming
0 references
vertex coloring problem
0 references
boundary point method
0 references
0 references
0.8967063426971436
0 references
0.8400527238845825
0 references
0.8102506399154663
0 references
0.805759608745575
0 references
