5 papers
Feature Augmentation of GNNs for ILPs: Local Uniqueness Suffices
Qingyu Han, Qian Li, Linxin Yang +3
Integer Linear Programs (ILPs) are central to real-world optimizations but notoriously difficult to solve. Learning to Optimize (L2O) has emerged as a promising paradigm, with Grap…
On Representing Convex Quadratically Constrained Quadratic Programs via Graph Neural Networks
Chenyang Wu, Qian Chen, Akang Wang +4
Convex quadratically constrained quadratic programs (QCQPs) involve finding a solution within a convex feasible region defined by quadratic constraints while minimizing a convex qu…
Exploring and Improving Initialization for Deep Graph Neural Networks: A Signal Propagation Perspective
Senmiao Wang, Yupeng Chen, Yushun Zhang +2
Graph Neural Networks (GNNs) often suffer from performance degradation as the network depth increases. This paper addresses this issue by introducing initialization methods that en…
When GNNs meet symmetry in ILPs: an orbit-based feature augmentation approach
Qian Chen, Lei Li, Qian Li +6
A common characteristic in integer linear programs (ILPs) is symmetry, allowing variables to be permuted without altering the underlying problem structure. Recently, GNNs have emer…
SymILO: A Symmetry-Aware Learning Framework for Integer Linear Optimization
Qian Chen, Tianjian Zhang, Linxin Yang +5
Integer linear programs (ILPs) are commonly employed to model diverse practical problems such as scheduling and planning. Recently, machine learning techniques have been utilized t…