STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some experiments with simulated annealing for coloring graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / 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: On generating all maximal independent sets / 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 new backtracking algorithm for generating the family of maximal independent sets of a graph / rank
 
Normal rank

Revision as of 10:30, 20 June 2024

scientific article
Language Label Description Also known as
English
STABULUS: A technique for finding stable sets in large graphs with tabu search
scientific article

    Statements

    STABULUS: A technique for finding stable sets in large graphs with tabu search (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    timetabling
    0 references
    tabu search
    0 references
    independent set problem
    0 references
    heuristic procedure
    0 references

    Identifiers