Routing Problem
Routing problems, encompassing the efficient allocation of resources across networks or the optimization of paths, aim to minimize costs (e.g., distance, time, or monetary expense) while satisfying constraints. Current research emphasizes the development and improvement of neural network-based approaches, including reinforcement learning, mixture-of-experts models, and graph neural networks, to address the challenges of scalability, robustness, and generalization across diverse problem types. These advancements hold significant potential for optimizing various real-world applications, such as logistics, telecommunications, and large language model deployment, by enabling faster and more efficient solutions to complex routing scenarios.
Papers
CartesianMoE: Boosting Knowledge Sharing among Experts via Cartesian Product Routing in Mixture-of-Experts
Zhenpeng Su, Xing Wu, Zijia Lin, Yizhe Xiong, Minxuan Lv, Guangyuan Ma, Hui Chen, Songlin Hu, Guiguang Ding
InternLM2.5-StepProver: Advancing Automated Theorem Proving via Expert Iteration on Large-Scale LEAN Problems
Zijian Wu, Suozhi Huang, Zhejian Zhou, Huaiyuan Ying, Jiayu Wang, Dahua Lin, Kai Chen