Exact and heuristic solution approaches for the generalized independent set problem

DOI10.1016/j.cor.2024.106561MaRDI QIDQ6551177

Jin-Kao Hao, Qinghua Wu, Mingming Zheng

Publication date: 6 June 2024

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch and boundheuristicadaptive local searchthe generalized independent set problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem
• Approximating the maximum vertex/edge weighted clique using local search
• The generalized independent set problem: polyhedral analysis and solution approaches
• Multi-neighborhood tabu search for the maximum weight clique problem
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
• Algorithms for the generalized independent set problem based on a quadratic optimization approach
• An effective modeling and solution approach for the generalized independent set problem
• A review on algorithms for maximum clique problems
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
• Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
• A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM

This page was built for publication: Exact and heuristic solution approaches for the generalized independent set problem