activity
20212026
most citedLearning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model

15 citations · 20 across the 15 of their papers we have counts for

collaborators
Showing cs.LGShow all

9 papers · 1 filter

cs.LG2026

Automated Optimization Modeling via a Localizable Error-Driven Perspective

Weiting Liu, Han Wu, Yufei Kuang +4

Automated optimization modeling via Large Language Models (LLMs) has emerged as a promising approach to assist complex human decision-making. While post-training has become a pivot…

cs.LG2024

MILP-StuDio: MILP Instance Generation via Block Structure Decomposition

Haoyang Liu, Jie Wang, Wanbo Zhang +6

Mixed-integer linear programming (MILP) is one of the most popular mathematical formulations with numerous applications. In practice, improving the performance of MILP solvers ofte…

cs.LG2024

Deep Symbolic Optimization for Combinatorial Optimization: Accelerating Node Selection by Discovering Potential Heuristics

Hongyu Liu, Haoyang Liu, Yufei Kuang +2

Combinatorial optimization (CO) is one of the most fundamental mathematical models in real-world applications. Traditional CO solvers, such as Branch-and-Bound (B&B) solvers, heavi…

cs.LG2024

Robust Deep Reinforcement Learning with Adaptive Adversarial Perturbations in Action Space

Qianmei Liu, Yufei Kuang, Jie Wang

Deep reinforcement learning (DRL) algorithms can suffer from modeling errors between the simulation and the real world. Many studies use adversarial learning to generate perturbati…

cs.LG2023★ 1 cited

State Sequences Prediction via Fourier Transform for Representation Learning

Mingxuan Ye, Yufei Kuang, Jie Wang +4

While deep reinforcement learning (RL) has been demonstrated effective in solving complex control tasks, sample efficiency remains a key challenge due to the large amounts of data…

cs.LG2023★ 2 cited

Accelerate Presolve in Large-Scale Linear Programming via Reinforcement Learning

Yufei Kuang, Xijun Li, Jie Wang +7

Large-scale LP problems from industry usually contain much redundancy that severely hurts the efficiency and reliability of solving LPs, making presolve (i.e., the problem simplifi…

cs.LG2023★ 1 cited

Promoting Generalization for Exact Solvers via Adversarial Instance Augmentation

Haoyang Liu, Yufei Kuang, Jie Wang +3

Machine learning has been successfully applied to improve the efficiency of Mixed-Integer Linear Programming (MILP) solvers. However, the learning-based solvers often suffer from s…

cs.LG2023★ 15 cited

Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model

Zhihai Wang, Xijun Li, Jie Wang +5

Cutting planes (cuts) are important for solving mixed-integer linear programs (MILPs), which formulate a wide range of important real-world applications. Cut selection -- which aim…

cs.LG2021

Learning Robust Policy against Disturbance in Transition Dynamics via State-Conservative Policy Optimization

Yufei Kuang, Miao Lu, Jie Wang +3

Deep reinforcement learning algorithms can perform poorly in real-world tasks due to the discrepancy between source and target environments. This discrepancy is commonly viewed as…