Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem

Abstract

The Maximum Weight Independent Set problem is a fundamental NP-hard problem in combinatorial optimization with several real-world applications. Given an undirected vertex-weighted graph, the problem is to find a subset of the vertices with the highest possible weight under the constraint that no two vertices in the set can share an edge. An important part of solving this problem in both theory and practice is data reduction rules, which several state-of-the-art algorithms rely on. However, the most complicated rules are often not used in applications since the time needed to check them exhaustively becomes infeasible. In this work, we introduce three main results. First, we introduce several new data reduction rules and evaluate their effectiveness on real-world data. Second, we use a machine learning screening algorithm to speed up the reduction phase, thereby enabling more complicated rules to be applied. Our screening algorithm consults a Graph Neural Network oracle to decide if the probability of successfully reducing the graph is sufficiently large. For this task, we provide a dataset of labeled vertices for use in supervised learning. We also present the first results for this dataset using established Graph Neural Network architectures. Third, we present a new concurrent metaheuristic called Concurrent Difference-Core Heuristic. On the reduced instances, we use our new metaheuristic combined with iterated local search, called CHILS (Concurrent Hybrid Iterated Local Search). For this iterated local search, we provide a new implementation specifically designed to handle large graphs of varying densities. CHILS outperforms the current state-of-the-art on all commonly used benchmark instances, especially the largest ones.