Publication:4411385

zbMath1019.90517MaRDI QIDQ4411385

Torsten Fahle

Publication date: 8 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610485.htm

zbMATH Keywords

branch-and-bound; constraint programming; maximum clique; cost based filtering

Mathematics Subject Classification ID

90C27: Combinatorial optimization

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems, Infra-chromatic bound for exact maximum clique search, 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, On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem, On comparing algorithms for the maximum clique problem, Exact algorithms for maximum clique: a computational study, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Incomplete inference for graph problems, Speeding up branch and bound algorithms for solving the maximum clique problem, A logical approach to efficient Max-SAT solving, Improvements to MCS algorithm for the maximum clique problem, Exploiting semidefinite relaxations in constraint programming, A review on algorithms for maximum clique problems, Extended and discretized formulations for the maximum clique problem, Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms, A New Approach to the Stable Set Problem Based on Ellipsoids, A Max-SAT Inference-Based Pre-processing for Max-Clique

Uses Software

• DIMACS