Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:54, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring graphs by iterated local search traversing feasible and infeasible solutions |
scientific article |
Statements
Coloring graphs by iterated local search traversing feasible and infeasible solutions (English)
0 references
21 January 2008
0 references
graph coloring benchmarks
0 references
heuristics
0 references
local search
0 references
vertex coloring
0 references
