A Tabu Search Heuristic for the Equitable Coloring Problem (Q3195344): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Graphs and an Application to Optimizing Municipal Services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free star-access in parallel memory systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compactness and balancing in scheduling / 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 polyhedral approach for the equitable coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of local search methods for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme / rank
 
Normal rank

Latest revision as of 22:44, 10 July 2024

scientific article
Language Label Description Also known as
English
A Tabu Search Heuristic for the Equitable Coloring Problem
scientific article

    Statements

    Identifiers

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