A study of ACO capabilities for solving the maximum clique problem (Q2491340): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-006-4295-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078732543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive, restart, randomized greedy heuristics for maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687254 / 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: Bandwidth Packing: A Tabu Search Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum clique problem using a tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colonies for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved ant system algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687250 / rank
 
Normal rank

Latest revision as of 16:12, 24 June 2024

scientific article
Language Label Description Also known as
English
A study of ACO capabilities for solving the maximum clique problem
scientific article

    Statements

    A study of ACO capabilities for solving the maximum clique problem (English)
    0 references
    0 references
    0 references
    29 May 2006
    0 references
    0 references
    Ant colony optimization
    0 references
    Maximum clique problem
    0 references
    Metaheuristic
    0 references
    0 references
    0 references
    0 references
    0 references