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
An adaptive multistart tabu search approach to solve the maximum clique 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, Multi-neighborhood tabu search for the maximum weight clique problem, Speeding up branch and bound algorithms for solving the maximum clique problem, Phased local search for the maximum clique problem, Complete Boolean satisfiability solving algorithms based on local search, Improvements to MCS algorithm for the maximum clique problem, A Max-SAT Inference-Based Pre-processing for Max-Clique
Uses Software