New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565)
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 variable neighborhood search method for minimum sum coloring problem on simple graphs |
scientific article; zbMATH DE number 7497026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New variable neighborhood search method for minimum sum coloring problem on simple graphs |
scientific article; zbMATH DE number 7497026 |
Statements
23 March 2022
0 references
minimum sum coloring
0 references
variable neighborhood search
0 references
skewed variable neighborhood search
0 references
chromatic sum
0 references
Hölder vertex
0 references
Hölder set
0 references
reducer set
0 references
New variable neighborhood search method for minimum sum coloring problem on simple graphs (English)
0 references
0 references
0.92064065
0 references
0.9014484
0 references
0.87098616
0 references
0.86982596
0 references
0.8676775
0 references
0.86530936
0 references
0.86396384
0 references
0.8629545
0 references
0.8625528
0 references
