{"total":46,"rows":[{"id":"2403.07041","title":"Ant Colony Sampling with GFlowNets for Combinatorial Optimization","created":"2024-03-11","cited_by_count":53,"area":null},{"id":"2410.21066","title":"Learning to Handle Complex Constraints for Vehicle Routing Problems","created":"2024-10-28","cited_by_count":29,"area":null},{"id":"2406.03503","title":"Position: Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems","created":"2024-06-02","cited_by_count":24,"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":"2501.03715","title":"Neural Deconstruction Search for Vehicle Routing Problems","created":"2025-01-07","cited_by_count":15,"area":null},{"id":"2503.03137","title":"Learning to Reduce Search Space for Generalizable Neural Routing Solver","created":"2025-03-05","cited_by_count":14,"area":null},{"id":"2410.04968","title":"Collaboration! Towards Robust Neural Methods for Routing Problems","created":"2024-10-07","cited_by_count":9,"area":null},{"id":"2408.16717","title":"GREAT: A Graph Edge Attention Network for the Electric Vehicle Routing Problem with Asymmetric Costs","created":"2024-08-29","cited_by_count":8,"area":null},{"id":"2603.03388","title":"RADAR: Learning to Route with Asymmetry-aware DistAnce Representations","created":"2026-03-03","cited_by_count":8,"area":null},{"id":"2405.08424","title":"Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More","created":"2024-05-14","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":"2403.17159","title":"Less Is More -- On the Importance of Sparsification for Transformers and Graph Neural Networks for TSP","created":"2024-03-25","cited_by_count":6,"area":null},{"id":"2402.04915","title":"Moco: A Learnable Meta Optimizer for Combinatorial Optimization","created":"2024-02-07","cited_by_count":5,"area":null},{"id":"2406.13125","title":"A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks","created":"2024-06-19","cited_by_count":5,"area":null},{"id":"2506.16428","title":"EFormer: An Effective Edge-based Transformer for Vehicle Routing Problems","created":"2025-06-19","cited_by_count":5,"area":null},{"id":"2507.01037","title":"Learning to Segment for Vehicle Routing Problems","created":"2025-06-22","cited_by_count":5,"area":null},{"id":"2502.02446","title":"Towards graph neural networks for provably solving convex optimization problems","created":"2025-02-04","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":"2411.09238","title":"Beyond the Heatmap: A Rigorous Evaluation of Component Impact in MCTS-Based TSP Solvers","created":"2024-11-14","cited_by_count":3,"area":null},{"id":"2602.16012","title":"Towards Efficient Constraint Handling in Neural Solvers for Routing Problems","created":"2026-02-17","cited_by_count":3,"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":"2507.04164","title":"Structure As Search: Unsupervised Permutation Learning for Combinatorial Optimization","created":"2025-07-05","cited_by_count":2,"area":null},{"id":"2602.08210","title":"CADO: From Imitation to Cost Minimization for Heatmap-based Solvers in Combinatorial Optimization","created":"2026-02-09","cited_by_count":2,"area":null},{"id":"2403.20212","title":"On Size and Hardness Generalization in Unsupervised Learning for the Travelling Salesman Problem","created":"2024-03-29","cited_by_count":1,"area":null},{"id":"2503.21814","title":"Unsupervised Ordering for Maximum Clique","created":"2025-03-25","cited_by_count":1,"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":"2601.13465","title":"Graph Neural Networks are Heuristics","created":"2026-01-19","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":"2406.03099","title":"Supplementary Materials to Graph Convolutional Branch and Bound","created":"2024-06-05","cited_by_count":0,"area":null},{"id":"2406.09441","title":"Comment on paper: Position: Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems","created":"2024-06-11","cited_by_count":0,"area":null},{"id":"2410.17111","title":"Permutation Picture of Graph Combinatorial Optimization Problems","created":"2024-10-22","cited_by_count":0,"area":null},{"id":"2411.18954","title":"ReMAP: Lossless Residual Neural Lifting for Scalable MAP Inference in Arbitrary-Order Markov Random Fields","created":"2024-11-28","cited_by_count":0,"area":null},{"id":"2502.19377","title":"Preference-Based Gradient Estimation for ML-Guided Approximate Combinatorial Optimization","created":"2025-02-26","cited_by_count":0,"area":null},{"id":"2503.20001","title":"Unsupervised Learning for Quadratic Assignment","created":"2025-03-25","cited_by_count":0,"area":null},{"id":"2504.08401","title":"Graph Reduction with Unsupervised Learning in Column Generation: A Routing Application","created":"2025-04-11","cited_by_count":0,"area":null},{"id":"2508.02510","title":"On Distributional Dependent Performance of Classical and Neural Routing Solvers","created":"2025-08-04","cited_by_count":0,"area":null},{"id":"2512.15800","title":"Edge-wise Topological Divergence Gaps: Guiding Search in Combinatorial Optimization","created":"2025-12-16","cited_by_count":0,"area":null},{"id":"2601.19041","title":"HeatACO: A Heatmap-Guided Max--Min Ant System for Large-Scale Travelling Salesman Problems","created":"2026-01-26","cited_by_count":0,"area":null},{"id":"2603.02462","title":"Can Computational Reducibility Lead to Transferable Models for Graph Combinatorial Optimization?","created":"2026-03-02","cited_by_count":0,"area":null},{"id":"2603.06260","title":"Learning to Solve Orienteering Problem with Time Windows and Variable Profits","created":"2026-03-06","cited_by_count":0,"area":null},{"id":"2605.09301","title":"Neural Cluster First, Route Second: Capacitated Vehicle Routing via Differentiable Optimal Transport","created":"2026-05-10","cited_by_count":0,"area":null},{"id":"2605.25551","title":"Learning Permutation from Structure Without Supervision","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.18514","title":"N(CO)$^2$: Neural Combinatorial Optimization with Chance Constraints to Solve Stochastic Orienteering","created":"2026-06-16","cited_by_count":0,"area":null},{"id":"2606.29725","title":"Optimizing Nursing Care Taxi Dispatch Leveraging Integer Linear Programming Solvers and Machine Learning","created":"2026-06-29","cited_by_count":0,"area":null},{"id":"2607.12127","title":"Connected by Construction: Learning Tractable Near-Tour Marginals for Traveling Salesman Problems","created":"2026-07-13","cited_by_count":0,"area":null},{"id":"2609.34585","title":"Compute Time Scaling with Recursive Models for Combinatorial Optimization","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}