A cutting plane algorithm for graph coloring (Q2467348): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pruning Procedure for Exact Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 14:36, 27 June 2024

scientific article
Language Label Description Also known as
English
A cutting plane algorithm for graph coloring
scientific article

    Statements

    A cutting plane algorithm for graph coloring (English)
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    graph coloring
    0 references
    integer programming
    0 references
    facets of polyhedra
    0 references
    cutting plane algorithms
    0 references
    0 references
    0 references

    Identifiers