{"total":24,"rows":[{"id":"2402.01145","title":"ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution","created":"2024-02-02","cited_by_count":276,"area":null},{"id":"2305.19587","title":"Towards Omni-generalizable Neural Methods for Vehicle Routing Problems","created":"2023-05-31","cited_by_count":69,"area":null},{"id":"2308.14104","title":"Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy","created":"2023-08-27","cited_by_count":62,"area":null},{"id":"2406.15007","title":"RouteFinder: Towards Foundation Models for Vehicle Routing Problems","created":"2024-06-21","cited_by_count":55,"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":"2401.06979","title":"Distance-aware Attention Reshaping: Enhance Generalization of Neural Solver for Large-scale Vehicle Routing Problems","created":"2024-01-13","cited_by_count":15,"area":null},{"id":"2407.00487","title":"It's Morphing Time: Unleashing the Potential of Multiple LLMs via Multi-objective Optimization","created":"2024-06-29","cited_by_count":10,"area":null},{"id":"2308.04639","title":"A Hierarchical Destroy and Repair Approach for Solving Very Large-Scale Travelling Salesman Problem","created":"2023-08-09","cited_by_count":4,"area":null},{"id":"2509.24509","title":"Experience-Guided Reflective Co-Evolution of Prompts and Heuristics for Automatic Algorithm Design","created":"2025-09-29","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":"2406.11897","title":"A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization","created":"2024-06-14","cited_by_count":3,"area":null},{"id":"2505.13025","title":"LiBOG: Lifelong Learning for Black-Box Optimizer Generation","created":"2025-05-19","cited_by_count":3,"area":null},{"id":"2501.15240","title":"Hardware-Aware DNN Compression for Homogeneous Edge Devices","created":"2025-01-25","cited_by_count":1,"area":null},{"id":"2509.21765","title":"Lifelong Learning with Behavior Consolidation for Vehicle Routing","created":"2025-09-26","cited_by_count":1,"area":null},{"id":"2605.13072","title":"Neural QAOA$^{2}$: Differentiable Joint Graph Partitioning and Parameter Initialization for Quantum Combinatorial Optimization","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2310.06484","title":"Memory efficient location recommendation through proximity-aware representation","created":"2023-10-10","cited_by_count":0,"area":null},{"id":"2410.24052","title":"Attention is All You Need to Optimize Wind Farm Operations and Maintenance","created":"2024-10-31","cited_by_count":0,"area":null},{"id":"2504.01985","title":"Multi-Dimensional AGV Path Planning in 3D Warehouses Using Ant Colony Optimization and Advanced Neural Networks","created":"2025-03-30","cited_by_count":0,"area":null},{"id":"2506.22848","title":"Scalable Structure Learning of Bayesian Networks by Learning Algorithm Ensembles","created":"2025-06-28","cited_by_count":0,"area":null},{"id":"2507.22440","title":"Nearest-Better Network for Visualizing and Analyzing Combinatorial Optimization Problems: A Unified Tool","created":"2025-07-30","cited_by_count":0,"area":null},{"id":"2512.08609","title":"CogMCTS: A Novel Cognitive-Guided Monte Carlo Tree Search Framework for Iterative Heuristic Evolution with Large Language Models","created":"2025-12-09","cited_by_count":0,"area":null},{"id":"2601.08696","title":"Enabling Population-Based Architectures for Neural Combinatorial Optimization","created":"2026-01-13","cited_by_count":0,"area":null},{"id":"2601.22509","title":"Keep Rehearsing and Refining: Lifelong Learning Vehicle Routing under Continually Drifting Tasks","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2608.13087","title":"Sampling Luck Masquerades as Allocation Gain: Auditing Test-Time Budget Allocation for Neural Combinatorial Optimization","created":"2026-08-13","cited_by_count":0,"area":null}],"next_cursor":null}