An effective local search for the maximum clique problem (Q1041822): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108455025 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56210425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chained Lin-Kernighan for Large Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / 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: Annealed replication: A new heuristic for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / 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: Q2776559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy and local search heuristics for unconstrained binary quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5321485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining the scalability of local search with the pruning techniques of systematic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495204 / rank
 
Normal rank

Latest revision as of 05:39, 2 July 2024

scientific article
Language Label Description Also known as
English
An effective local search for the maximum clique problem
scientific article

    Statements

    An effective local search for the maximum clique problem (English)
    0 references
    0 references
    0 references
    0 references
    4 December 2009
    0 references
    graph algorithms
    0 references
    combinatorial optimization
    0 references
    variable depth search
    0 references
    neighborhood
    0 references
    maximum clique problem
    0 references
    0 references
    0 references
    0 references

    Identifiers

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