Multi-neighborhood tabu search for the maximum weight clique problem
From MaRDI portal
Publication:1761843
DOI10.1007/S10479-012-1124-3zbMATH Open1251.90378OpenAlexW2094836579MaRDI QIDQ1761843FDOQ1761843
Authors: Qinghua Wu, Jin-Kao Hao, Fred Glover 
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1124-3
Recommendations
- An adaptive multistart tabu search approach to solve the maximum clique problem
- scientific article; zbMATH DE number 956850
- A new algorithm for the maximum-weight clique problem
- A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
- A new branch-and-bound algorithm for the maximum weighted clique problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Title not available (Why is that?)
- GRASP for set packing problems.
- An augmentation algorithm for the maximum weighted stable set problem
- Neighborhood portfolio approach for local search applied to timetabling problems
- Title not available (Why is that?)
- Approximating the maximum vertex/edge weighted clique using local search
- A fast algorithm for the maximum weight clique problem
- Solving the maximum clique problem using a tabu search approach
- A new trust region technique for the maximum weight clique problem
- A new approach for modeling and solving set packing problems
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Reactive local search for the maximum clique problem
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- An effective local search for the maximum clique problem
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Title not available (Why is that?)
- Reactive and dynamic local search for max-clique: engineering effective building blocks
- Data dependent worst case bounds for weighted set packing
Cited In (36)
- Metaheuristics for a scheduling problem with rejection and tardiness penalties
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Solution of the clique problem by reducing it to a problem with a d.c. constraint
- An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
- A hybrid iterated local search heuristic for the maximum weight independent set problem
- On solving simplified diversified top-\(k\,s\)-plex problem
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
- Graph multi-coloring for a job scheduling application
- Detecting robust cliques in graphs subject to uncertain edge failures
- Meta-heuristics and artificial intelligence
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
- Solving the maximum vertex weight clique problem via binary quadratic programming
- A variable neighborhood search heuristic for the maximum ratio clique problem
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- 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
- Variable neighborhood search: basics and variants
- PUSH: A generalized operator for the maximum vertex weight clique problem
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem
- A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- Variable neighborhood search for the maximum clique
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem
- Maximum weight relaxed cliques and Russian doll search revisited
- Models and algorithms for the weighted safe set problem
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
- Diversification strategies in tabu search algorithms for the maximum clique problem
- An application of tabu search heuristic for the maximum edge-weighted subgraph problem
- A review on algorithms for maximum clique problems
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- Exact and heuristic solution approaches for the generalized independent set problem
- Tabu search tutorial. A graph drawing application
Uses Software
This page was built for publication: Multi-neighborhood tabu search for the maximum weight clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761843)
