Publication:3623999
From MaRDI portal
zbMath1182.68065arXiv1109.5717MaRDI QIDQ3623999
No author found.
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1109.5717
Related Items
Breakout local search for maximum clique problems, A new exact maximum clique algorithm for large and massive sparse graphs, An adaptive multistart tabu search approach to solve the maximum clique problem, Fast local search for the maximum independent set problem, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, Approximating the maximum vertex/edge weighted clique using local search, Simple ingredients leading to very efficient heuristics for the maximum clique problem, Reactive and dynamic local search for max-clique: engineering effective building blocks, On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem, Clustered maximum weight clique problem: algorithms and empirical analysis, Frequency-driven tabu search for the maximum \(s\)-plex problem, PUSH: A generalized operator for the maximum vertex weight clique problem, Multi-neighborhood tabu search for the maximum weight clique problem, Speeding up branch and bound algorithms for solving the maximum clique problem, Subgraph extraction and metaheuristics for the maximum clique problem, Phased local search for the maximum clique problem, Finding near-optimal independent sets at scale, Complete Boolean satisfiability solving algorithms based on local search, Improvements to MCS algorithm for the maximum clique problem, A review on algorithms for maximum clique problems, A Max-SAT Inference-Based Pre-processing for Max-Clique
Uses Software
