{"total":27,"rows":[{"id":"2406.15079","title":"GOAL: A Generalist Combinatorial Optimization Agent Learner","created":"2024-06-21","cited_by_count":42,"area":null},{"id":"2406.00415","title":"Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives","created":"2024-06-01","cited_by_count":23,"area":null},{"id":"2506.02392","title":"Improving Generalization of Neural Combinatorial Optimization for Vehicle Routing Problems via Test-Time Projection Learning","created":"2025-06-03","cited_by_count":12,"area":null},{"id":"2505.13904","title":"Learning to Insert for Constructive Neural Vehicle Routing Solver","created":"2025-05-20","cited_by_count":10,"area":null},{"id":"2509.23413","title":"URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization","created":"2025-09-27","cited_by_count":8,"area":null},{"id":"2409.03811","title":"PARCO: Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization","created":"2024-09-05","cited_by_count":7,"area":null},{"id":"2507.00218","title":"Learning for routing: A guided review of recent developments and future directions","created":"2025-06-30","cited_by_count":7,"area":null},{"id":"2411.01667","title":"GraphXForm: Graph transformer for computer-aided molecular design","created":"2024-11-03","cited_by_count":6,"area":null},{"id":"2407.17206","title":"Take a Step and Reconsider: Sequence Decoding for Self-Improved Neural Combinatorial Optimization","created":"2024-07-24","cited_by_count":4,"area":null},{"id":"2602.21761","title":"Survey on Neural Routing Solvers","created":"2026-02-25","cited_by_count":4,"area":null},{"id":"2506.06634","title":"GELD: A Unified Neural Model for Efficiently Solving Traveling Salesman Problems Across Different Scales","created":"2025-06-07","cited_by_count":3,"area":null},{"id":"2502.10233","title":"Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding","created":"2025-02-14","cited_by_count":2,"area":null},{"id":"2502.12484","title":"LocalEscaper: A Weakly-supervised Framework with Regional Reconstruction for Scalable Neural TSP Solvers","created":"2025-02-18","cited_by_count":2,"area":null},{"id":"2503.12662","title":"TuneNSearch: a hybrid transfer learning and local search approach for solving vehicle routing problems","created":"2025-03-16","cited_by_count":2,"area":null},{"id":"2603.01667","title":"Chain-of-Context Learning: Dynamic Constraint Understanding for Multi-Task VRPs","created":"2026-03-02","cited_by_count":2,"area":null},{"id":"2509.05084","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","created":"2025-09-05","cited_by_count":1,"area":null},{"id":"2603.00430","title":"Efficient Decoder Scaling Strategy for Neural Routing Solvers","created":"2026-02-28","cited_by_count":1,"area":null},{"id":"2605.10122","title":"Rethinking Constraint Awareness for Efficient State Embedding of Neural Routing Solver","created":"2026-05-11","cited_by_count":1,"area":null},{"id":"2510.12273","title":"Multi-Action Self-Improvement for Neural Combinatorial Optimization","created":"2025-10-14","cited_by_count":0,"area":null},{"id":"2602.10984","title":"Sample Efficient Generative Molecular Optimization with Joint Self-Improvement","created":"2026-02-11","cited_by_count":0,"area":null},{"id":"2602.12162","title":"Amortized Molecular Optimization via Group Relative Policy Optimization","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2605.18094","title":"Learning to Solve Compositional Geometry Routing Problems","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2605.26690","title":"Self-Improvement Imitation with Biologically Guided Search for Protein Design Under Oracle Budgets","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2606.04039","title":"Beyond Static Priors: Dynamic Neural Guidance for Large-Scale Ant Colony Optimization","created":"2026-06-02","cited_by_count":0,"area":null},{"id":"2607.11146","title":"Rank-Conditioned Sample Reuse for the Plackett--Luce Best-of-$K$ Objective","created":"2026-07-13","cited_by_count":0,"area":null},{"id":"2610.01685","title":"MiLoop: Selective Memory Propagation for Neural Combinatorial Optimization","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.15106","title":"RELAGRAM: Recursive Latent Graph Model for the Capacitated Vehicle Routing Problem","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}