Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355)

From MaRDI portal
Revision as of 22:48, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    21 January 2008
    0 references
    graph coloring benchmarks
    0 references
    heuristics
    0 references
    local search
    0 references
    vertex coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references