A hybrid heuristic for the maximum clique problem (Q2491328): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-006-3750-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976659547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized Crossover for the Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems / 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: A genetic algorithm for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3035310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / 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: Q5480099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418383 / 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: Q4198056 / 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: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complementary Pivoting Approach to the Maximum Weight Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687257 / rank
 
Normal rank

Latest revision as of 15:11, 24 June 2024

scientific article
Language Label Description Also known as
English
A hybrid heuristic for the maximum clique problem
scientific article

    Statements

    A hybrid heuristic for the maximum clique problem (English)
    0 references
    0 references
    0 references
    29 May 2006
    0 references
    Combinatorial optimization
    0 references
    Greedy heuristic
    0 references
    Maximum clique
    0 references
    Steady-state genetic algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers