A cutting plane algorithm for graph coloring (Q2467348)

From MaRDI portal
Revision as of 18:47, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A cutting plane algorithm for graph coloring
scientific article

    Statements

    title
    A cutting plane algorithm for graph coloring (English)
    0 references
    author
    Paula Zabala
    0 references
    Isabel Méndez-Díaz
    0 references
    publication date
    21 January 2008
    0 references
    zbMATH Keywords
    graph coloring
    0 references
    integer programming
    0 references
    facets of polyhedra
    0 references
    cutting plane algorithms
    0 references
    describes a project that uses
    ABACUS
    0 references
    CPLEX
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C10
    0 references
    05C85
    0 references
    05C15
    0 references
    zbMATH DE Number
    5228809
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2467348&oldid=23977606"
    Powered by MediaWiki