Breakout local search for maximum clique problems
From MaRDI portal
(Redirected from Publication:339563)
Recommendations
- scientific article
- An effective local search for the maximum clique problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
Cites work
- scientific article; zbMATH DE number 5547826 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A fast algorithm for the maximum clique problem
- A fast algorithm for the maximum weight clique problem
- A hybrid heuristic for the maximum clique problem
- A study of ACO capabilities for solving the maximum clique problem
- An adaptive multistart tabu search approach to solve the maximum clique problem
- An application of tabu search heuristic for the maximum edge-weighted subgraph problem
- An effective local search for the maximum clique problem
- An exact bit-parallel algorithm for the maximum clique problem
- Annealed replication: A new heuristic for the maximum clique problem
- Approximating the maximum vertex/edge weighted clique using local search
- Finding a Maximum Clique in an Arbitrary Graph
- Iterated local search for the quadratic assignment problem
- Landscapes, operators and heuristic search
- Phased local search for the maximum clique problem
- Reactive local search for the maximum clique problem
- Reactive search and intelligent optimization
- Reducibility among combinatorial problems
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Variable neighborhood search for the maximum clique
Cited in
(23)- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
- 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
- An opposition-based memetic algorithm for the maximum quasi-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
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
- A hybrid iterated local search heuristic for the maximum weight independent set problem
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
- Incremental Upper Bound for the Maximum Clique Problem
- scientific article; zbMATH DE number 5547826 (Why is no real title available?)
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
- Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
- Two-phase heuristics for the \(k\)-club problem
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
- A review on algorithms for maximum clique problems
- Breakout local search for the quadratic assignment problem
This page was built for publication: Breakout local search for maximum clique problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339563)
