Breakout local search for maximum clique problems (Q339563): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2012.06.002 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2012.06.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972760347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum weight clique problem / 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: Reactive local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive search and intelligent optimization / 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: STABULUS: A technique for finding stable sets in large graphs with tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / 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: Reducibility among Combinatorial Problems / 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: The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of tabu search heuristic for the maximum edge-weighted subgraph 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: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3623999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phased local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the maximum vertex/edge weighted clique using local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landscapes, operators and heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact bit-parallel algorithm for the maximum clique problem / 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: Iterated local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive multistart tabu search approach to solve the maximum clique problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2012.06.002 / rank
 
Normal rank

Latest revision as of 14:48, 9 December 2024

scientific article
Language Label Description Also known as
English
Breakout local search for maximum clique problems
scientific article

    Statements

    Breakout local search for maximum clique problems (English)
    0 references
    0 references
    0 references
    11 November 2016
    0 references
    clique
    0 references
    breakout local search
    0 references
    adaptive diversification
    0 references
    attractor
    0 references
    fitness-distance correlation
    0 references
    0 references
    0 references
    0 references

    Identifiers