Learning to Reduce Search Space for Generalizable Neural Routing Solver 事件

Learning to Reduce Search Space for Generalizable Neural Routing Solver arXiv:2503.03137v3 Announce Type: replace Abstract: Constructive neural combinatorial optimization (NCO) offers a promising paradigm for solving vehicle routing problems (VRPs) by directly learning to construct approximate optimal solutions, thereby reducing reliance on expert knowledge for algorithm design. However, scaling these methods to handle large-scale instances remains challenging due to high computational complexi