{"total":40,"rows":[{"id":"2406.15007","title":"RouteFinder: Towards Foundation Models for Vehicle Routing Problems","created":"2024-06-21","cited_by_count":55,"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.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":"2410.01432","title":"Adaptive teachers for amortized samplers","created":"2024-10-02","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":"2502.17100","title":"Generative Models in Decision Making: A Survey","created":"2025-02-24","cited_by_count":15,"area":null},{"id":"2405.16012","title":"Pessimistic Backward Policy for GFlowNets","created":"2024-05-25","cited_by_count":14,"area":null},{"id":"2408.05284","title":"Can a Bayesian Oracle Prevent Harm from an Agent?","created":"2024-08-09","cited_by_count":13,"area":null},{"id":"2410.02596","title":"Beyond Squared Error: Exploring Loss Design for Enhanced Training of Generative Flow Networks","created":"2024-10-03","cited_by_count":11,"area":null},{"id":"2503.16159","title":"RRNCO: Towards Real-World Routing with Neural Combinatorial Optimization","created":"2025-03-20","cited_by_count":11,"area":null},{"id":"2502.07735","title":"Revisiting Non-Acyclic GFlowNets in Discrete Environments","created":"2025-02-11","cited_by_count":10,"area":null},{"id":"2503.01931","title":"Adversarial Generative Flow Network for Solving Vehicle Routing Problems","created":"2025-03-03","cited_by_count":10,"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":"2409.03811","title":"PARCO: Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization","created":"2024-09-05","cited_by_count":7,"area":null},{"id":"2510.04792","title":"Hybrid-Balance GFlowNet for Solving Vehicle Routing Problems","created":"2025-10-06","cited_by_count":7,"area":null},{"id":"2510.07073","title":"VRPAgent: LLM-Driven Discovery of Heuristic Operators for Vehicle Routing Problems","created":"2025-10-08","cited_by_count":7,"area":null},{"id":"2503.04047","title":"Reheated Gradient-based Discrete Sampling for Combinatorial Optimization","created":"2025-03-06","cited_by_count":6,"area":null},{"id":"2510.11711","title":"Reinforced sequential Monte Carlo for amortised sampling","created":"2025-10-13","cited_by_count":6,"area":null},{"id":"2502.10433","title":"Neural Genetic Search in Discrete Spaces","created":"2025-02-09","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":"2602.21761","title":"Survey on Neural Routing Solvers","created":"2026-02-25","cited_by_count":4,"area":null},{"id":"2508.15442","title":"Mitigating Hallucinations in LM-Based TTS Models via Distribution Alignment Using GFlowNets","created":"2025-08-21","cited_by_count":2,"area":null},{"id":"2602.00549","title":"Beyond the Node: Clade-level Selection for Efficient MCTS in Automatic Heuristic Design","created":"2026-01-31","cited_by_count":2,"area":null},{"id":"2603.01786","title":"Learning Shortest Paths with Generative Flow Networks","created":"2026-03-02","cited_by_count":2,"area":null},{"id":"2505.05119","title":"USPR: Learning a Unified Solver for Profiled Routing","created":"2025-05-08","cited_by_count":1,"area":null},{"id":"2602.04119","title":"Synthesizable Molecular Generation via Soft-constrained GFlowNets with Rich Chemical Priors","created":"2026-02-04","cited_by_count":1,"area":null},{"id":"2602.11491","title":"Exploring Multiple High-Scoring Subspaces in Generative Flow Networks","created":"2026-02-12","cited_by_count":1,"area":null},{"id":"2605.01729","title":"Stable GFlowNets with TV Monitoring and Probabilistic Guarantees","created":"2026-05-03","cited_by_count":1,"area":null},{"id":"2505.20110","title":"Beyond the Proxy: Trajectory-Distilled Guidance for Offline GFlowNet Training","created":"2025-05-26","cited_by_count":0,"area":null},{"id":"2506.03672","title":"Latent Guided Sampling for Combinatorial Optimization","created":"2025-06-04","cited_by_count":0,"area":null},{"id":"2508.08659","title":"Hybrid Node-Destroyer Model with Large Neighborhood Search for Solving the Capacitated Vehicle Routing Problem","created":"2025-08-12","cited_by_count":0,"area":null},{"id":"2508.14071","title":"Edge-Selector Model Applied for Local Search Neighborhood for Solving Vehicle Routing Problems","created":"2025-08-12","cited_by_count":0,"area":null},{"id":"2510.00958","title":"Test-Time Search in Neural Graph Coarsening Procedures for the Capacitated Vehicle Routing Problem","created":"2025-10-01","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.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":"2602.00488","title":"OD-Gear: Online Decomposition and Group Sampling for Expert-Guided Adversarial Routing in Scalable Capacitated Vehicle Routing","created":"2026-01-31","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":"2606.01425","title":"Learning-based Directed Graph Abstraction of Combinatorial Spaces for Order-Preserving Search in Mixed-Combinatorial Nonlinear Optimization","created":"2026-05-31","cited_by_count":0,"area":null},{"id":"2606.06272","title":"Your GFlowNet Secretly Learns an Optimal Transport Plan","created":"2026-06-04","cited_by_count":0,"area":null},{"id":"2609.35514","title":"One Proposal for Every Margin: Zero-Shot Amortized Sequential Importance Sampling for Binary Matrices","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}