scientific article; zbMATH DE number 1947416
From MaRDI portal
Publication:4411385
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A review on algorithms for maximum clique problems, A logical approach to efficient Max-SAT solving, On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem, Infra-chromatic bound for exact maximum clique search, Extended and discretized formulations for the maximum clique problem, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, On comparing algorithms for the maximum clique problem, Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms, A Max-SAT Inference-Based Pre-processing for Max-Clique, An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems, CliSAT: a new exact algorithm for hard maximum clique problems, Incomplete inference for graph problems, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, Improvements to MCS algorithm for the maximum clique problem, Incremental Upper Bound for the Maximum Clique Problem, Exact algorithms for maximum clique: a computational study, A New Approach to the Stable Set Problem Based on Ellipsoids, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Speeding up branch and bound algorithms for solving the maximum clique problem, A new branch-and-bound algorithm for the maximum weighted clique problem, Exploiting semidefinite relaxations in constraint programming, Simple ingredients leading to very efficient heuristics for the maximum clique problem
Uses Software
