New heuristics for the vertex coloring problem based on semidefinite programming (Q351547): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10100-012-0276-1 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10100-012-0276-1 / rank | |||
Normal rank | |||
Latest revision as of 15:10, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New heuristics for the vertex coloring problem based on semidefinite programming |
scientific article |
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
