Multi-neighborhood tabu search for the maximum weight clique problem
From MaRDI portal
Publication:1761843
DOI10.1007/s10479-012-1124-3zbMath1251.90378OpenAlexW2094836579MaRDI QIDQ1761843
Jin-Kao Hao, Fred Glover, Qinghua Wu
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (25)
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem ⋮ A review on algorithms for maximum clique problems ⋮ Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem ⋮ Solving the maximum vertex weight clique problem via binary quadratic programming ⋮ Detecting robust cliques in graphs subject to uncertain edge failures ⋮ 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 ⋮ Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem ⋮ An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network ⋮ 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 ⋮ Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem ⋮ Graph multi-coloring for a job scheduling application ⋮ 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† ⋮ Models and algorithms for the weighted safe set problem ⋮ On solving simplified diversified top-\(k\,s\)-plex problem ⋮ Variable neighborhood search: basics and variants ⋮ Tabu search tutorial. A graph drawing application ⋮ 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 ⋮ Metaheuristics for a scheduling problem with rejection and tardiness penalties ⋮ A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Approximating the maximum vertex/edge weighted clique using local search
- Reactive and dynamic local search for max-clique: engineering effective building blocks
- An effective local search for the maximum clique problem
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- A fast algorithm for the maximum weight clique problem
- GRASP for set packing problems.
- An augmentation algorithm for the maximum weighted stable set 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
- Data dependent worst case bounds for weighted set packing
- Neighborhood portfolio approach for local search applied to timetabling problems
- Reactive local search for the maximum clique problem
This page was built for publication: Multi-neighborhood tabu search for the maximum weight clique problem
