A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks
<|reference_start|>A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks: 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.<|reference_end|>
@article{jin2024a,
    title={A Unified Framework for Combinatorial Optimization Based on Graph Neural
  Networks},
    author={Yaochu Jin, Xueming Yan, Shiqing Liu, and Xiangyu Wang},
    journal={arXiv preprint arXiv:2406.13125},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.13125},
    primaryClass={cs.AI}
}