{"total":24,"rows":[{"id":"2210.04123","title":"DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems","created":"2022-10-08","cited_by_count":129,"area":null},{"id":"2110.07983","title":"NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem","created":"2021-10-15","cited_by_count":103,"area":null},{"id":"2304.09407","title":"Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem","created":"2023-04-19","cited_by_count":50,"area":null},{"id":"2304.09395","title":"H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problem","created":"2023-04-19","cited_by_count":43,"area":null},{"id":"2302.01578","title":"Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning","created":"2023-02-03","cited_by_count":37,"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":"2105.02741","title":"Meta-Learning-Based Deep Reinforcement Learning for Multiobjective Optimization Problems","created":"2021-05-06","cited_by_count":20,"area":null},{"id":"2207.03876","title":"Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems","created":"2022-07-08","cited_by_count":12,"area":null},{"id":"2110.03595","title":"Generalization in Deep RL for TSP Problems via Equivariance and Local Search","created":"2021-10-07","cited_by_count":9,"area":null},{"id":"2208.02447","title":"DL-DRL: A double-level deep reinforcement learning approach for large-scale task scheduling of multi-UAV","created":"2022-08-04","cited_by_count":9,"area":null},{"id":"2104.03546","title":"Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks","created":"2021-04-08","cited_by_count":8,"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":"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":"2108.10224","title":"A New Constructive Heuristic driven by Machine Learning for the Traveling Salesman Problem","created":"2021-08-17","cited_by_count":2,"area":null},{"id":"2310.06543","title":"An Edge-Aware Graph Autoencoder Trained on Scale-Imbalanced Data for Traveling Salesman Problems","created":"2023-10-10","cited_by_count":2,"area":null},{"id":"2107.06870","title":"Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem","created":"2021-07-09","cited_by_count":1,"area":null},{"id":"2404.11458","title":"Learn to Tour: Operator Design For Solution Feasibility Mapping in Pickup-and-delivery Traveling Salesman Problem","created":"2024-04-17","cited_by_count":1,"area":null},{"id":"2505.15862","title":"Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems","created":"2025-05-21","cited_by_count":1,"area":null},{"id":"2508.01557","title":"Unsupervised Learning for the Elementary Shortest Path Problem","created":"2025-08-03","cited_by_count":1,"area":null},{"id":"2205.00242","title":"Approximating Permutations with Neural Network Components for Travelling Photographer Problem","created":"2022-04-30","cited_by_count":0,"area":null},{"id":"2408.08484","title":"An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem","created":"2024-08-16","cited_by_count":0,"area":null},{"id":"2502.05221","title":"Blackout DIFUSCO","created":"2025-02-05","cited_by_count":0,"area":null},{"id":"2604.06724","title":"The Traveling Thief Problem with Time Windows: Benchmarks and Heuristics","created":"2026-04-08","cited_by_count":0,"area":null},{"id":"2605.17339","title":"Bridging the Gap between Sparse Matrix Reordering and Factorization: A Deep Learning Framework for Fill-in Reduction","created":"2026-05-17","cited_by_count":0,"area":null}],"next_cursor":null}