Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

@article{Grosso2004CombiningSA,
  title={Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem},
  author={A. Grosso and M. Locatelli and F. D. Croce},
  journal={Journal of Heuristics},
  year={2004},
  volume={10},
  pages={135-152}
}
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the… Expand
Dynamic Local Search for the Maximum Clique Problem
TLDR
It is shown empirically that DLSMC achieves substantial performance improvements over state-of-the-art algorithms for the maximum clique problem over a large range of the commonly used DIMACS benchmark instances. Expand
Phased local search for the maximum clique problem
  • W. Pullan
  • Mathematics, Computer Science
  • J. Comb. Optim.
  • 2006
TLDR
Phased Local Search has no problem instance dependent parameters and achieves state-of-the-art performance for the maximum clique problem over a large range of the commonly used DIMACS benchmark instances. Expand
Simple ingredients leading to very efficient heuristics for the maximum clique problem
TLDR
The heuristics tested in this paper are basically parameter free: most of the DIMACS benchmark instances are solved within very short CPU times and a new putative optimum was discovered by one of the algorithms. Expand
A hybrid heuristic for the maximum clique problem
TLDR
This paper presents a heuristic based steady-state genetic algorithm for the maximum clique problem that outperforms all the three evolutionary approaches in terms of best and average clique sizes found on majority of DIMACS benchmark instances. Expand
Multi-neighborhood tabu search for the maximum weight clique problem
TLDR
A tabu search heuristic whose key features include a combined neighborhood and a dedicated tabu mechanism using a randomized restart strategy for diversification that outperforms the leading algorithm for the maximum weight clique problem and rivals the performance of the best methods for the unweighted version of the problem. Expand
Investigating ACO capabilities for solving the Maximum Clique Problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of pairwise adjacentExpand
A study of ACO capabilities for solving the maximum clique problem
TLDR
The benefit of integrating a local search procedure within the proposed ACO algorithm, and it is shown that this improves the solution process, and ACO performance is compared with that of three other representative heuristic approaches, showing that the former obtains competitive results. Expand
A review on algorithms for maximum clique problems
TLDR
This review provides an updated and comprehensive review on both exact and heuristic MCP algorithms, with a special focus on recent developments, and identifies the general framework followed by these algorithms and pinpoint the key ingredients that make them successful. Expand
Fast local search for the maximum independent set problem
TLDR
Two fast local search routines are introduced that can determine in linear time whether a maximal solution can be improved by replacing a single vertex with two others and a more elaborate heuristic that successfully applies local search to find near-optimum solutions to a wide variety of instances is presented. Expand
Cooperating local search for the maximum clique problem
TLDR
Cooperating local search (CLS) is introduced, a parallelised hyper-heuristic for the maximum clique problem which improves the state-of-the-art performance over all the BHOSLIB benchmark instances and attains unprecedented consistency over the state of the art on the DIMACS benchmark instances. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique
TLDR
This paper presents some adaptive restart randomized greedy heuristics for MAXIMUM CLIQUE, and finds that the different strategies produce different effects, and that different algorithms work best on different kinds of graphs. Expand
Reactive Local Search for the Maximum Clique Problem1
TLDR
Reactive Local Search is based on local search complemented by a feedback (history-sensitive) scheme to determine the amount of diversification, in a manner inspired by Tabu Search, for the solution of the Maximum-Clique problem. Expand
A fast algorithm for the maximum clique problem
TLDR
A branch-and-bound algorithm for the maximum clique problem--which is computationally equivalent to the maximum independent (stable) set problem--is presented with the vertex order taken from a coloring of the vertices and with a new pruning strategy. Expand
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
TLDR
Computational results indicate that the heuristic frequently finds the optimal or expected optimal solution in a fraction of the time required by implementations of simulated annealing, tabu search, and an exact partial enumeration method. Expand
Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
Let G=(V, E) be an undirected graph where V and E are the sets of vertices and edges of G, respectively. A subset of the vertices S⊆ V is independent if all of its members are pairwise nonadjacent,Expand
A new trust region technique for the maximum weight clique problem
  • S. Busygin
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 2006
TLDR
A new simple generalization of the Motzkin-Straus theorem for the maximum weight clique problem is formulated and directly proved and a trust region heuristic is developed that regards not only the global optimum of a quadratic objective over a sphere, but also a set of other stationary points of the program. Expand
Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem
TLDR
The results show that the hardness of the graphs produced by this method depends in a crucial way on the construction parameters; for a given edge density, challenging graphs can only be constructed using this method for a certain range of maximum clique values. Expand
Maximum stable set formulations and heuristics based on continuous optimization
TLDR
It is shown that restricting the matrix variable in the Lovász semidefinite program to be rank-one and rank-two yields a pair of continuous, nonlinear optimization problems each having the global optimal value α(G). Expand
An algorithm for finding a maximum clique in a graph
  • D. Wood
  • Mathematics, Computer Science
  • Oper. Res. Lett.
  • 1997
TLDR
A branch-and-bound algorithm for the maximum clique problem which applies existing clique finding and vertex coloring heuristics to determine lower and upper bounds for the size of amaximum clique is introduced. Expand
A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere
TLDR
A heuristic for the maximum independent set problem is proposed which utilizes classical results for the problem of optimization of a quadratic function over a sphere and its efficiency is confirmed by results of numerical experiments on DIMACS benchmarks. Expand
...
1
2
...