activity
20222026
most citedLearning Generalizable Models for Vehicle Routing Problems via Knowledge Distillation

25 citations · 28 across the 11 of their papers we have counts for

collaborators
Showing 2026Show all

6 papers · 1 filter

cs.CL2026

FormuEvo: LLM-Guided Evolution for Discovering Solver-Efficient Mixed-Integer Programming Formulations

Haofeng Yuan, Jianing Peng, Jieyi Bi +3

Mixed-integer programming (MIP) lies at the core of operations research and industrial optimization. While large language models (LLMs) have recently shown promise in automated MIP…

cs.LG2026

PLAN: Parallel Liquid-Inspired Approximation Network for Efficient Representation Learning in Flexible Job Shop Scheduling

Dhivya Dharshini Kannan, Wei Zhang, Jieyi Bi +5

Deep reinforcement learning (DRL) approaches for flexible job shop scheduling (FJSP) heavily rely on attention-centric architectures to achieve state-of-the-art performance. Howeve…

cs.AI2026

ToolAnchor: Anchoring Counterfactual Context to Boost Agentic Tool-use Capability

Weiting Liu, Jieyi Bi, Wanqi Zhou +4

Tool-augmented large language model agents excel at long-horizon tasks, yet they are typically post-trained on fixed toolsets. When tasks demand new tools, these agents struggle to…

cs.AI2026

Interpreting Neural Combinatorial Optimization via Evolving Programmatic Bottlenecks

Haocheng Duan, Yuxin Guo, Jieyi Bi +4

Neural Combinatorial Optimization (NCO) achieves strong performance, yet its black-box nature remains a key roadblock to deployment and scientific diagnosis. Standard interpretabil…

cs.AI2026

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…

cs.AI2026

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…