Liming Gong — accepted AI-conference papers

2025

BTBS-LNS: Binarized-Tightening, Branch and Search on Learning LNS Policies for MIP

Hao Yuan, Wenli Ouyang, Changwen Zhang, Yong Sun, Liming Gong, Junchi Yan

ICLR 2025poster

Learning to solve large-scale Mixed Integer Program (MIP) problems is an emerging research topic, and policy learning-based Large Neighborhood Search (LNS) has been a popular paradigm. However, the explored space of LNS policy is often limited even in the training phase, making the learned policy so…

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

Towards Imitation Learning to Branch for MIP: A Hybrid Reinforcement Learning based Sample Augmentation Approach

Changwen Zhang, Wenli Ouyang, Hao Yuan, Liming Gong, Yong Sun, Ziao Guo +2

ICLR 2024poster

Branch-and-bound (B\&B) has long been favored for tackling complex Mixed Integer Programming (MIP) problems, where the choice of branching strategy plays a pivotal role. Recently, Imitation Learning (IL)-based policies have emerged as potent alternatives to traditional rule-based approaches. However…

Cited by 8 Source ↗PDF ↗Scholar ↗