Breakout local search for maximum clique problems

DOI10.1016/j.cor.2012.06.002zbMath1349.90005OpenAlexW1972760347MaRDI QIDQ339563

Jin-Kao Hao, Una Benlic

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.06.002

zbMATH Keywords

attractorcliqueadaptive diversificationbreakout local searchfitness-distance correlation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata, A review on algorithms for maximum clique problems, Two-phase heuristics for the \(k\)-club problem, Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling, On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem, Clustered maximum weight clique problem: algorithms and empirical analysis, Frequency-driven tabu search for the maximum \(s\)-plex problem, A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs, An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network, A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets, An efficient local search algorithm for solving maximum edge weight clique problem in large graphs, An opposition-based memetic algorithm for the maximum quasi-clique problem, An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs, An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†, Incremental Upper Bound for the Maximum Clique Problem, A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs, A hybrid iterated local search heuristic for the maximum weight independent set problem, PUSH: A generalized operator for the maximum vertex weight clique problem, A hybrid breakout local search and reinforcement learning approach to the vertex separator problem, Breakout local search for the Steiner tree problem with revenue, budget and hop constraints, SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem

Uses Software

• DIMACS
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An adaptive multistart tabu search approach to solve the maximum clique problem
• Variable neighborhood search for the maximum clique
• An exact bit-parallel algorithm for the maximum clique problem
• Reactive search and intelligent optimization
• Approximating the maximum vertex/edge weighted clique using local search
• An effective local search for the maximum clique problem
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Landscapes, operators and heuristic search
• A fast algorithm for the maximum weight clique problem
• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
• A fast algorithm for the maximum clique problem
• Annealed replication: A new heuristic for the maximum clique problem
• An application of tabu search heuristic for the maximum edge-weighted subgraph problem
• Phased local search for the maximum clique problem
• A hybrid heuristic for the maximum clique problem
• A study of ACO capabilities for solving the maximum clique problem
• Iterated local search for the quadratic assignment problem
• Finding a Maximum Clique in an Arbitrary Graph
• Reducibility among Combinatorial Problems
• Reactive local search for the maximum clique problem