A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371)

From MaRDI portal
Revision as of 03:36, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
scientific article

    Statements

    A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (English)
    0 references
    0 references
    0 references
    5 April 2012
    0 references
    frequency assignment
    0 references
    adjacent colors
    0 references
    integer programming
    0 references

    Identifiers