PUSH: A generalized operator for the maximum vertex weight clique problem

DOI10.1016/j.ejor.2016.07.056zbMath1394.90506OpenAlexW2481273247MaRDI QIDQ1752768

Xianqiang Yang

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.07.056

zbMATH Keywords

heuristicstabu searchlocal searchcliques

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Boosting ant colony optimization via solution prediction and machine learning ⋮ 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 ⋮ General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem ⋮ Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism ⋮ A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs ⋮ Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs ⋮ A new upper bound for the maximum weight clique problem ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem

Uses Software

• QUALEX
• Tabu search

Cites Work

• Solving the maximum vertex weight clique problem via binary quadratic programming
• Breakout local search for maximum clique problems
• Solving the maximum edge weight clique problem via unconstrained quadratic programming
• An exact algorithm for the maximum clique problem
• Approximating the maximum vertex/edge weighted clique using local search
• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• A cutting-plane approach to the edge-weighted maximal clique problem
• A fast algorithm for the maximum clique problem
• Multi-neighborhood tabu search for the maximum weight clique problem
• An augmentation algorithm for the maximum weighted stable set problem
• A new trust region technique for the maximum weight clique problem
• A hybrid heuristic for the maximum clique problem
• A review on algorithms for maximum clique problems
• An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem
• Principles and Practice of Constraint Programming – CP 2004
• Algorithm for optimal winner determination in combinatorial auctions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: PUSH: A generalized operator for the maximum vertex weight clique problem