Breakout local search for maximum clique problems

From MaRDI portal
Publication:339563

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




Related Items (21)

Finding Maximum Clique in Stochastic Graphs Using Distributed Learning AutomataA review on algorithms for maximum clique problemsTwo-phase heuristics for the \(k\)-club problemIterated local search based on multi-type perturbation for single-machine earliness/tardiness schedulingOn minimization of the number of branches in branch-and-bound algorithms for the maximum clique problemClustered maximum weight clique problem: algorithms and empirical analysisFrequency-driven tabu search for the maximum \(s\)-plex problemA CPU-GPU local search heuristic for the maximum weight clique problem on massive graphsAn approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural networkA Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating SetsAn efficient local search algorithm for solving maximum edge weight clique problem in large graphsAn opposition-based memetic algorithm for the maximum quasi-clique problemAn integer program and new lower bounds for computing the strong rainbow connection numbers of graphsAn efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†Incremental Upper Bound for the Maximum Clique ProblemA Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse GraphsA hybrid iterated local search heuristic for the maximum weight independent set problemPUSH: A generalized operator for the maximum vertex weight clique problemA hybrid breakout local search and reinforcement learning approach to the vertex separator problemBreakout local search for the Steiner tree problem with revenue, budget and hop constraintsSCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem


Uses Software


Cites Work


This page was built for publication: Breakout local search for maximum clique problems