Solving the maximum clique problem using a tabu search approach (Q2367014): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum 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: Cliques in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STABULUS: A technique for finding stable sets in large graphs with tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique detection for nondirected graphs: Two new algorithms / 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: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629667 / 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: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / 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
Property / cites work
 
Property / cites work: Determining the number of internal stability of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expose-and-merge exploration and the chromatic number of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum weighted independent set in an arbitrary graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization approach for solving the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Progress in Graph Theory in the Soviet Union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search techniques. A tutorial and an application to neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank

Latest revision as of 17:19, 17 May 2024

scientific article
Language Label Description Also known as
English
Solving the maximum clique problem using a tabu search approach
scientific article

    Statements

    Solving the maximum clique problem using a tabu search approach (English)
    0 references
    0 references
    0 references
    0 references
    16 August 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references