Reactive local search for the maximum clique problem
From MaRDI portal
Publication:5943666
DOI10.1007/s004530010074zbMath0985.68016OpenAlexW1984217603WikidataQ56210392 ScholiaQ56210392MaRDI QIDQ5943666
Roberto Battiti, Marco Protasi
Publication date: 19 February 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004530010074
Related Items (37)
Subgraph extraction and metaheuristics for the maximum clique problem ⋮ Phased local search for the maximum clique problem ⋮ Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata ⋮ A review on algorithms for maximum clique problems ⋮ Algorithmic height compression of unordered trees ⋮ Clustered maximum weight clique problem: algorithms and empirical analysis ⋮ Breakout local search for maximum clique problems ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Extended and discretized formulations for the maximum clique problem ⋮ An adaptive multistart tabu search approach to solve the maximum clique problem ⋮ Finding near-optimal independent sets at scale ⋮ An efficient local search algorithm for solving maximum edge weight clique problem in large graphs ⋮ Some spin glass ideas applied to the clique problem ⋮ Solving maximum clique problem using chemical reaction optimization ⋮ An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† ⋮ Maximum independent sets and supervised learning ⋮ Local search with edge weighting and configuration checking heuristics for minimum vertex cover ⋮ Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\) ⋮ Optimal \((n,4,2)\)-OOC of small orders. ⋮ Local search for Boolean satisfiability with configuration checking and subscore ⋮ An efficient local search for the feedback vertex set problem ⋮ Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling ⋮ Fast local search for the maximum independent set problem ⋮ Multi-neighborhood tabu search for the maximum weight clique problem ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Variable neighborhood search for the maximum clique ⋮ A hybrid heuristic for the maximum clique problem ⋮ A study of ACO capabilities for solving the maximum clique problem ⋮ On constant composition codes ⋮ Mining relevant information on the Web: a clique-based approach ⋮ On the independent set problem in random graphs ⋮ Maximum cut-clique problem: ILS heuristics and a data analysis application ⋮ Simple ingredients leading to very efficient heuristics for the maximum clique problem ⋮ An analysis of parameter adaptation in reactive tabu search ⋮ Reactive and dynamic local search for max-clique: engineering effective building blocks ⋮ An effective local search for the maximum clique problem ⋮ Solving maximum independent set by asynchronous distributed hopfield-type neural networks
This page was built for publication: Reactive local search for the maximum clique problem
