A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844)
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 7421300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic |
scientific article; zbMATH DE number 7421300 |
Statements
A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (English)
0 references
5 November 2021
0 references
metaheuristics
0 references
graph \(b\)-coloring
0 references
integer programming
0 references
fix-and-optimize
0 references
matheuristics
0 references
0 references
0 references
0 references
0 references
0 references
0.8187602162361145
0 references
0.7649281024932861
0 references
0.7476813793182373
0 references
0.7260534763336182
0 references
0.720093309879303
0 references
