Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
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-007-9055-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994203526 / 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: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum stable set formulations and heuristics based on continuous optimization / 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: Approximation of the Stability Number of a Graph via Copositive Programming / 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: Q4411385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials / 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: Adaptive, restart, randomized greedy heuristics for maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687246 / 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: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / 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: Q3623999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competition polysemy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of the Delsarte and Lovász bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of ACO capabilities for solving the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum clique in a graph / rank
 
Normal rank

Latest revision as of 10:04, 1 July 2024

scientific article
Language Label Description Also known as
English
Simple ingredients leading to very efficient heuristics for the maximum clique problem
scientific article

    Statements

    Simple ingredients leading to very efficient heuristics for the maximum clique problem (English)
    0 references
    0 references
    0 references
    0 references
    31 March 2009
    0 references
    0 references
    maximum clique
    0 references
    randomness
    0 references
    plateau search
    0 references
    penalties
    0 references
    restart rules
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references