11 papers · 1 filter
A General Neural Backbone for Mixed-Integer Linear Optimization via Dual Attention
Peixin Huang, Yaoxin Wu, Yining Ma +3
Mixed-integer linear programming (MILP) is a foundational framework for combinatorial optimization across science and engineering, but remains hard to solve at scale due to NP-hard…
Learning Scenario Reduction for Two-Stage Robust Optimization with Discrete Uncertainty
Tianjue Lin, Jianan Zhou, Jieyi Bi +4
Two-Stage Robust Optimization (2RO) with discrete uncertainty is challenging, often rendering exact solutions prohibitive. Scenario reduction alleviates this issue by selecting a s…
Preference-Driven Multi-Objective Combinatorial Optimization with Conditional Computation
Mingfeng Fan, Jianan Zhou, Yifeng Zhang +3
Recent deep reinforcement learning methods have achieved remarkable success in solving multi-objective combinatorial optimization problems (MOCOPs) by decomposing them into multipl…
DRAGON: LLM-Driven Decomposition and Reconstruction Agents for Large-Scale Combinatorial Optimization
Shengkai Chen, Zhiguang Cao, Jianan Zhou +5
Large Language Models (LLMs) have recently shown promise in addressing combinatorial optimization problems (COPs) through prompt-based strategies. However, their scalability and ge…
Towards Efficient Constraint Handling in Neural Solvers for Routing Problems
Jieyi Bi, Zhiguang Cao, Jianan Zhou +5
Neural solvers have achieved impressive progress in addressing simple routing problems, particularly excelling in computational efficiency. However, their advantages under complex…
Bridging Synthetic and Real Routing Problems via LLM-Guided Instance Generation and Progressive Adaptation
Jianghan Zhu, Yaoxin Wu, Zhuoyi Lin +5
Recent advances in Neural Combinatorial Optimization (NCO) methods have significantly improved the capability of neural solvers to handle synthetic routing instances. Nonetheless,…