Fractional programming formulation for the vertex coloring problem (Q402376): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on vertex coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for graph coloring / 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: On the asymmetric representatives formulation for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques, holes and the vertex coloring polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unconstrained quadratic binary programming approach to the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A supernodal formulation of vertex colouring with applications in course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the clique partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-weight stable sets and safe lower bounds for graph coloring / rank
 
Normal rank

Latest revision as of 23:33, 8 July 2024

scientific article
Language Label Description Also known as
English
Fractional programming formulation for the vertex coloring problem
scientific article

    Statements

    Fractional programming formulation for the vertex coloring problem (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2014
    0 references
    combinatorial problems
    0 references
    vertex coloring
    0 references
    fractional programming formulation
    0 references
    mixed integer linear programming problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references