Publication:4411385
From MaRDI portal
zbMath1019.90517MaRDI QIDQ4411385
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610485.htm
Related Items
Local search with edge weighting and configuration checking heuristics for minimum vertex cover, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, Simple ingredients leading to very efficient heuristics for the maximum clique problem, Incomplete inference for graph problems, A logical approach to efficient Max-SAT solving, Improvements to MCS algorithm for the maximum clique problem, Exploiting semidefinite relaxations in constraint programming, Extended and discretized formulations for the maximum clique problem, A New Approach to the Stable Set Problem Based on Ellipsoids, A Max-SAT Inference-Based Pre-processing for Max-Clique
Uses Software