Arrow Research search

Author name cluster

Qingyu Han

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
2 author rows

Possible papers

2

NeurIPS Conference 2024 Conference Paper

SymILO: A Symmetry-Aware Learning Framework for Integer Linear Optimization

  • Qian Chen
  • Tianjian Zhang
  • Linxin Yang
  • Qingyu Han
  • Akang Wang
  • Ruoyu Sun
  • Xiaodong Luo
  • Tsung-Hui Chang

Integer linear programs (ILPs) are commonly employed to model diverse practical problems such as scheduling and planning. Recently, machine learning techniques have been utilized to solve ILPs. A straightforward idea is to train a model via supervised learning, with an ILP as the input and an optimal solution as the label. An ILP is symmetric if its variables can be permuted without changing the problem structure, resulting in numerous equivalent and optimal solutions. Randomly selecting an optimal solution as the label can introduce variability in the training data, which may hinder the model from learning stable patterns. In this work, we incorporate the intrinsic symmetry of ILPs and propose a novel training framework called SymILO. Specifically, we modify the learning task by introducing solution permutation along with neural network weights as learnable parameters and then design an alternating algorithm to jointly optimize the loss function. We conduct extensive experiments on ILPs involving different symmetries and the computational results demonstrate that our symmetry-aware approach significantly outperforms three existing methods----achieving $50. 3\\%$, $66. 5\\%$, and $45. 4\\%$ average improvements, respectively.

ICLR Conference 2023 Conference Paper

A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming

  • Qingyu Han
  • Linxin Yang
  • Qian Chen
  • Xiang Zhou
  • Dong Zhang
  • Akang Wang
  • Ruoyu Sun 0001
  • Xiaodong Luo

Mixed-integer linear programming (MILP) is widely employed for modeling combinatorial optimization problems. In practice, similar MILP instances with only coefficient variations are routinely solved, and machine learning (ML) algorithms are capable of capturing common patterns across these MILP instances. In this work, we combine ML with optimization and propose a novel predict-and-search framework for efficiently identifying high-quality feasible solutions. Specifically, we first utilize graph neural networks to predict the marginal probability of each variable, and then search for the best feasible solution within a properly defined ball around the predicted solution. We conduct extensive experiments on public datasets, and computational results demonstrate that our proposed framework achieves 51.1% and 9.9% performance improvements to MILP solvers SCIP and Gurobi on primal gaps, respectively.

v2026.09.13