{"total":41,"rows":[{"id":"2104.14624","title":"The Logic of Graph Neural Networks","created":"2021-04-29","cited_by_count":85,"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":"2109.10129","title":"Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits","created":"2021-09-21","cited_by_count":38,"area":null},{"id":"2206.13211","title":"Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set","created":"2022-06-27","cited_by_count":33,"area":null},{"id":"2208.10227","title":"One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction","created":"2022-08-22","cited_by_count":27,"area":null},{"id":"2109.05536","title":"Link Scheduling using Graph Neural Networks","created":"2021-09-12","cited_by_count":26,"area":null},{"id":"2206.01506","title":"Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?","created":"2022-06-03","cited_by_count":25,"area":null},{"id":"2202.08396","title":"Augment with Care: Contrastive Learning for Combinatorial Problems","created":"2022-02-17","cited_by_count":22,"area":null},{"id":"2205.06002","title":"Learning Generalized Policies Without Supervision Using GNNs","created":"2022-05-12","cited_by_count":22,"area":null},{"id":"2311.14156","title":"Variational Annealing on Graphs for Combinatorial Optimization","created":"2023-11-23","cited_by_count":21,"area":null},{"id":"2301.03116","title":"Unsupervised Learning for Combinatorial Optimization Needs Meta-Learning","created":"2023-01-08","cited_by_count":20,"area":null},{"id":"2207.11542","title":"Annealed Training for Combinatorial Optimization on Graphs","created":"2022-07-23","cited_by_count":18,"area":null},{"id":"2208.04055","title":"Neural Set Function Extensions: Learning with Discrete Functions in High Dimensions","created":"2022-08-08","cited_by_count":14,"area":null},{"id":"2204.07000","title":"Solving AC Power Flow with Graph Neural Networks under Realistic Constraints","created":"2022-04-14","cited_by_count":11,"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":"2205.11638","title":"DOGE-Train: Discrete Optimization on GPU with End-to-end Training","created":"2022-05-23","cited_by_count":6,"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":"2301.11164","title":"A Graph Neural Network with Negative Message Passing for Graph Coloring","created":"2023-01-26","cited_by_count":5,"area":null},{"id":"2310.05309","title":"Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods","created":"2023-10-08","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":"2407.16468","title":"Enhancing GNNs Performance on Combinatorial Optimization by Recurrent Feature Update","created":"2024-07-23","cited_by_count":4,"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":"2510.24039","title":"Geometric Algorithms for Neural Combinatorial Optimization with Constraints","created":"2025-10-28","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":"2402.15524","title":"Graph Pruning for Enumeration of Minimal Unsatisfiable Subsets","created":"2024-02-19","cited_by_count":2,"area":null},{"id":"2302.06926","title":"Lightsolver challenges a leading deep learning solver for Max-2-SAT problems","created":"2023-02-14","cited_by_count":1,"area":null},{"id":"2306.06523","title":"Finding Hamiltonian cycles with graph neural networks","created":"2023-06-10","cited_by_count":1,"area":null},{"id":"2310.19990","title":"Unveiling the Limits of Learned Local Search Heuristics: Are You the Mightiest of the Meek?","created":"2023-10-30","cited_by_count":1,"area":null},{"id":"2312.11547","title":"A Unified Pre-training and Adaptation Framework for Combinatorial Optimization on Graphs","created":"2023-12-16","cited_by_count":1,"area":null},{"id":"2409.20259","title":"Learning to Ground Existentially Quantified Goals","created":"2024-09-30","cited_by_count":1,"area":null},{"id":"2505.19497","title":"Learning for Dynamic Combinatorial Optimization without Training Data","created":"2025-05-26","cited_by_count":1,"area":null},{"id":"2603.20801","title":"Large Neighborhood Search meets Iterative Neural Constraint Heuristics","created":"2026-03-21","cited_by_count":1,"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":"2601.18917","title":"GraIP: A Benchmarking Framework For Neural Graph Inverse Problems","created":"2026-01-26","cited_by_count":0,"area":null},{"id":"2601.21048","title":"Test-Time Adaptation for Unsupervised Combinatorial Optimization","created":"2026-01-28","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.11456","title":"UniHetCO: A Unified Heterogeneous Representation for Multi-Problem Learning in Unsupervised Neural Combinatorial Optimization","created":"2026-03-12","cited_by_count":0,"area":null},{"id":"2605.13673","title":"Graph Neural Networks with Triangle-Based Messages for the Multicut Problem","created":"2026-05-13","cited_by_count":0,"area":null},{"id":"2607.19635","title":"Anatomy of a Sound Neural Reasoner: One-Shot Amortization, First-Pass Poisoning, and Search Inertness in Clue-Rich Completion","created":"2026-07-22","cited_by_count":0,"area":null},{"id":"2608.14569","title":"Position: Certified Correctness in Neural Constraint Reasoning Requires Symbolic Integration","created":"2026-06-02","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}],"next_cursor":null}