activity
20212026
most citedGeneralization in Deep RL for TSP Problems via Equivariance and Local Search

6 citations · 10 across the 7 of their papers we have counts for

collaborators

8 papers

cs.AI2026

FrontierOR: Benchmarking LLMs' Capacity for Efficient Algorithm Design in Large-Scale Optimization

Minwei Kong, Chonghe Jiang, Ao Qu +24

Large language models (LLMs) are increasingly used for optimization modeling and solver-code generation, yet practical operations research and optimization problems often require a…

cs.AI2025

AlphaOPT: Formulating Optimization Programs with Self-Improving LLM Experience Library

Minwei Kong, Ao Qu, Xiaotong Guo +12

Optimization modeling underlies critical decision-making across industries, yet remains difficult to automate: natural-language problem descriptions must be translated into precise…

cs.LG2025

Learning to Segment for Vehicle Routing Problems

Wenbin Ouyang, Sirui Li, Yining Ma +1

Iterative heuristics are widely recognized as state-of-the-art for Vehicle Routing Problems (VRPs). In this work, we exploit a critical observation: a large portion of the solution…

math.OC2025★ 1 cited

Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop Scheduling

Sirui Li, Wenbin Ouyang, Yining Ma +1

Long-horizon combinatorial optimization problems (COPs), such as the Flexible Job-Shop Scheduling Problem (FJSP), often involve complex, interdependent decisions over extended time…

cs.CV2023

TLMCM Network for Medical Image Hierarchical Multi-Label Classification

Meng Wu, Siyan Luo, Qiyu Wu +1

Medical Image Hierarchical Multi-Label Classification (MI-HMC) is of paramount importance in modern healthcare, presenting two significant challenges: data imbalance and \textit{hi…

math.OC2023★ 3 cited

Learning to Configure Separators in Branch-and-Cut

Sirui Li, Wenbin Ouyang, Max B. Paulus +1

Cutting planes are crucial in solving mixed integer linear programs (MILP) as they facilitate bound improvements on the optimal solution. Modern MILP solvers rely on a variety of s…

cs.LG2021★ 6 cited

Generalization in Deep RL for TSP Problems via Equivariance and Local Search

Wenbin Ouyang, Yisen Wang, Paul Weng +1

Deep reinforcement learning (RL) has proved to be a competitive heuristic for solving small-sized instances of traveling salesman problems (TSP), but its performance on larger-size…

cs.LG2021

Improving Generalization of Deep Reinforcement Learning-based TSP Solvers

Wenbin Ouyang, Yisen Wang, Shaochen Han +2

Recent work applying deep reinforcement learning (DRL) to solve traveling salesman problems (TSP) has shown that DRL-based solvers can be fast and competitive with TSP heuristics f…