Incremental Upper Bound for the Maximum Clique Problem (Q5131716): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MaxCliqueDyn / 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.1287/ijoc.2017.0770 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2776934400 / 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: 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: 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: Optimizing with minimum satisfiability / 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: 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: Optimal Protein Structure Alignment Using Maximum Cliques / 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: Q4954175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: easy generation of hard (satisfiable) instances / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 23:58, 23 July 2024

scientific article; zbMATH DE number 7271629
Language Label Description Also known as
English
Incremental Upper Bound for the Maximum Clique Problem
scientific article; zbMATH DE number 7271629

    Statements

    Incremental Upper Bound for the Maximum Clique Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2020
    0 references
    maxclique
    0 references
    MaxSAT
    0 references
    incremental upper bound
    0 references

    Identifiers