Graph neural networks (GNNs) have emerged as a powerful tool for solving combinatorial optimization problems (COPs), exhibiting state-of-the-art performance in both graph-structured and non-graph-structured domains. However, existing approaches lack a unified framework capable of addressing a wide range of COPs. After presenting a summary of representative COPs and a brief review of recent advancements in GNNs for solving COPs, this paper proposes a unified framework for solving COPs based on GNNs, including graph representation of COPs, equivalent conversion of non-graph structured COPs to graph-structured COPs, graph decomposition, and graph simplification. The proposed framework leverages the ability of GNNs to effectively capture the relational information and extract features from the graph representation of COPs, offering a generic solution to COPs that can address the limitations of state-of-the-art in solving non-graph-structured and highly complex graph-structured COPs.

基于图神经网络 (GNNs) 的统一框架，解决组合优化问题 (COPs)，包括 COPs 的图表示、非图结构 COPs 转换为图结构 COPs 的等效转换、图分解和图简化，利用 GNNs 有效捕获关系信息和提取COPs图表示的特征，为 COPs 提供了通用解决方案，能够解决非图结构和高度复杂图结构的 COPs 限制。

基于图神经网络的组合优化统一框架