Solving vertex coloring problems as maximum weight stable set problems (Q516805): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2016.09.018 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q57659018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Cornaz-Jost transformation to solve the graph coloring problem / 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: On the asymmetric representatives formulation for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-to-one correspondence between colorings and stable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Gallai identities operating on Lovász number / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounding techniques for DSATUR-based branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact weighted vertex coloring via branch-and-price / 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: Maximum-weight stable sets and safe lower bounds for graph coloring / 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: Models and heuristic algorithms for a weighted vertex coloring problem / 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 polyhedral approach for the equitable coloring problem / 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 fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new \textsf{DSATUR}-based algorithm for exact vertex coloring / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.09.018 / rank
 
Normal rank

Latest revision as of 20:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Solving vertex coloring problems as maximum weight stable set problems
scientific article

    Statements

    Solving vertex coloring problems as maximum weight stable set problems (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2017
    0 references
    vertex coloring
    0 references
    stable set
    0 references
    mixed integer linear programming
    0 references
    computational experiments
    0 references

    Identifiers