An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187)

From MaRDI portal
Revision as of 23:55, 5 July 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
An unconstrained quadratic binary programming approach to the vertex coloring problem
scientific article

    Statements

    An unconstrained quadratic binary programming approach to the vertex coloring problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 March 2006
    0 references
    graph coloring
    0 references
    combinatorial optimization
    0 references
    tabu search
    0 references

    Identifiers