Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: QUALEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Benchmarks for Optimization Software / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Cliquer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: EXTRACOL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s12532-012-0042-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103159428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions to linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new trust region technique for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring algorithm for large scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple branching scheme for vertex coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the vertex coloring problem / 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 Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / 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: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum annealing of the graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring large graphs based on independent set extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 09:09, 6 July 2024

scientific article
Language Label Description Also known as
English
Maximum-weight stable sets and safe lower bounds for graph coloring
scientific article

    Statements

    Maximum-weight stable sets and safe lower bounds for graph coloring (English)
    0 references
    0 references
    0 references
    0 references
    10 April 2013
    0 references
    graph coloring
    0 references
    fractional chromatic number
    0 references
    column generation
    0 references
    maximum-weight stable set
    0 references
    safe computations
    0 references
    0 references
    0 references
    0 references

    Identifiers

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