Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 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 / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / 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/s10898-013-0075-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013020979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast local search for the maximum independent set 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: A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new table of constant weight codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-detection models in computational biochemistry and genomics / 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: Q4719750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / 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: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple ingredients leading to very efficient heuristics for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Cliques Elude the Metropolis Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3623999 / 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: Q4452109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique / rank
 
Normal rank

Latest revision as of 16:56, 8 July 2024

scientific article
Language Label Description Also known as
English
Speeding up branch and bound algorithms for solving the maximum clique problem
scientific article

    Statements

    Speeding up branch and bound algorithms for solving the maximum clique problem (English)
    0 references
    0 references
    0 references
    0 references
    3 July 2014
    0 references
    maximum clique problem
    0 references
    branch and bound algorithm
    0 references
    heuristic solution
    0 references
    graph colouring
    0 references
    0 references
    0 references
    0 references

    Identifiers

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