On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2017.02.017 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: BBMCL / 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.1016/j.cor.2017.02.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2589796617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Protein Structure Alignment Using Maximum Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakout local search for maximum clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining market data: a network approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with edge weighting and configuration checking heuristics for minimum vertex cover / 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: Greedy and heuristic algorithms for codes and colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411385 / 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: Q2837833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Keller’s cube-tiling conjecture is false in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-threading a state-of-the-art maximum clique algorithm / 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: Exact algorithms for maximum clique: a computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3623999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on branch and cut algorithms for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / 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: Relaxed approximate coloring in exact maximum clique search / 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
Property / cites work
 
Property / cites work: A review on algorithms for maximum clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: easy generation of hard (satisfiable) instances / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2017.02.017 / rank
 
Normal rank

Latest revision as of 01:06, 11 December 2024

scientific article
Language Label Description Also known as
English
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
scientific article

    Statements

    On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    maximum clique problem
    0 references
    branch-and-bound
    0 references
    branching ordering
    0 references
    incremental maxsat reasoning
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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