{"total":25,"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":"2305.17010","title":"Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets","created":"2023-05-26","cited_by_count":40,"area":null},{"id":"2311.14156","title":"Variational Annealing on Graphs for Combinatorial Optimization","created":"2023-11-23","cited_by_count":21,"area":null},{"id":"2310.00526","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","created":"2023-10-01","cited_by_count":11,"area":null},{"id":"2406.19705","title":"DISCO: Efficient Diffusion Solver for Large-Scale Combinatorial Optimization Problems","created":"2024-06-28","cited_by_count":11,"area":null},{"id":"2505.16952","title":"FrontierCO: Real-World and Large-Scale Evaluation of Machine Learning Solvers for Combinatorial Optimization","created":"2025-05-22","cited_by_count":11,"area":null},{"id":"2502.00277","title":"Regularized Langevin Dynamics for Combinatorial Optimization","created":"2025-02-01","cited_by_count":10,"area":null},{"id":"2409.02135","title":"Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling","created":"2024-09-02","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":"2402.04915","title":"Moco: A Learnable Meta Optimizer for Combinatorial Optimization","created":"2024-02-07","cited_by_count":5,"area":null},{"id":"2303.13117","title":"RLOR: A Flexible Framework of Deep Reinforcement Learning for Operation Research","created":"2023-03-23","cited_by_count":4,"area":null},{"id":"2504.00613","title":"LLM-Guided Search for Deletion-Correcting Codes","created":"2025-04-01","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":"2408.02207","title":"MARCO: A Memory-Augmented Reinforcement Framework for Combinatorial Optimization","created":"2024-08-05","cited_by_count":3,"area":null},{"id":"2310.07979","title":"Graph-SCP: Accelerating Set Cover Problems with Graph Neural Networks","created":"2023-10-12","cited_by_count":2,"area":null},{"id":"2605.30920","title":"Unsupervised Diffusion Solver for Combinatorial Optimization via Combinatorial Adjoint Matching","created":"2026-05-29","cited_by_count":2,"area":null},{"id":"2211.14405","title":"Learning Branching Heuristics from Graph Neural Networks","created":"2022-11-26","cited_by_count":1,"area":null},{"id":"2405.16409","title":"Network Interdiction Goes Neural","created":"2024-05-26","cited_by_count":1,"area":null},{"id":"2211.02681","title":"Deep Distance Sensitivity Oracles","created":"2022-11-02","cited_by_count":0,"area":null},{"id":"2411.13248","title":"On lower bounds of the density of planar periodic sets without unit distances","created":"2024-11-20","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":"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.25149","title":"Dual-GNN Multilevel Coarsening for Maximum Independent Set","created":"2026-09-21","cited_by_count":0,"area":null},{"id":"2609.25728","title":"Self-Supervised Combinatorial Optimization with Constraints via Frank-Wolfe","created":"2026-09-22","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}