A simple simulated annealing algorithm for the maximum clique problem (Q2456476): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: Annealed replication: A new heuristic for the maximum clique problem / 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: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for graph coloring and maximal clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling competitive Hopfield networks for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate conflict continuation graphs for multi-layer constrained via minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attacks of simple block ciphers via efficient heuristics / 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 branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing algorithm for determining the thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining GP operators with SA search to evolve fuzzy rule based classifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / rank
 
Normal rank

Latest revision as of 10:17, 27 June 2024

scientific article
Language Label Description Also known as
English
A simple simulated annealing algorithm for the maximum clique problem
scientific article

    Statements

    A simple simulated annealing algorithm for the maximum clique problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2007
    0 references
    Simulated annealing algorithm
    0 references
    maximum clique problem
    0 references
    minimum vertex cover problem
    0 references
    NP-hard optimization problem
    0 references
    heuristic algorithm
    0 references

    Identifiers

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