19 citations · 52 across the 54 of their papers we have counts for
5 papers · 1 filter
Not All Problems Are Best Modeled as MILP: A DSL-Centric Framework for Flexible and Accurate Optimization Modeling
Shaofeng Zhang, Hongyuan Su, Qingwen Peng +4
Solving combinatorial optimization problems (COPs) requires not only efficient algorithms but also carefully crafted formulations. While recent works have leveraged LLMs to automat…
Evolving Parallel Algorithm Portfolios via Potential-Aware Instance Generation with LLMs
Shaofeng Zhang, Shengcai Liu, Zhiyuan Wang +1
The Automatic Construction of Portfolios via Large Language Models (LLM-ACP) suffers from poor generalization in practical few-shot scenarios when solving complex combinatorial opt…
Cooperative Coevolution for Resource-Constrained Agentic LLM Post-Training
Zhiyuan Wang, Shengcai Liu, Jiahao Wu +5
Tool-using large language model (LLM) agents produce long, multi-turn trajectories, making gradient-based post-training memory-intensive. Evolution strategies (ES) enable memory-ef…
AHD Agent: Agentic Reinforcement Learning for Automatic Heuristic Design
Haoze Lv, Ning Lu, Ziang Zhou +2
Automatic heuristic design (AHD) has emerged as a promising paradigm for solving NP-hard combinatorial optimization problems (COPs). Recent works show that large language models (L…
Towards Feature-free TSP Solver Selection: A Deep Learning Approach
Kangfei Zhao, Shengcai Liu, Yu Rong +1
The Travelling Salesman Problem (TSP) is a classical NP-hard problem and has broad applications in many disciplines and industries. In a large scale location-based services system,…