{"total":24,"rows":[{"id":"2303.10538","title":"Unsupervised Learning for Solving the Travelling Salesman Problem","created":"2023-03-19","cited_by_count":58,"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":"2311.14156","title":"Variational Annealing on Graphs for Combinatorial Optimization","created":"2023-11-23","cited_by_count":21,"area":null},{"id":"2208.08561","title":"Geometric Scattering on Measure Spaces","created":"2022-08-17","cited_by_count":17,"area":null},{"id":"2310.00526","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","created":"2023-10-01","cited_by_count":11,"area":null},{"id":"2206.10078","title":"The Manifold Scattering Transform for High-Dimensional Point Cloud Data","created":"2022-06-21","cited_by_count":9,"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":"2510.24039","title":"Geometric Algorithms for Neural Combinatorial Optimization with Constraints","created":"2025-10-28","cited_by_count":4,"area":null},{"id":"2310.17579","title":"BLIS-Net: Classifying and Analyzing Signals on Graphs","created":"2023-10-26","cited_by_count":3,"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":"2503.21814","title":"Unsupervised Ordering for Maximum Clique","created":"2025-03-25","cited_by_count":1,"area":null},{"id":"2510.01022","title":"VDW-GNNs: Vector diffusion wavelets for geometric graph neural networks","created":"2025-10-01","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":"2403.09742","title":"A short review on the maximum clique problem algorithms with classical, AI, and quantum methods","created":"2024-03-13","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":"2412.11205","title":"Concept Learning in the Wild: Towards Algorithmic Understanding of Neural Networks","created":"2024-12-15","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":"2511.22866","title":"ARM-Explainer -- Explaining and improving graph neural network predictions for the maximum clique problem using node features and association rule mining","created":"2025-11-28","cited_by_count":0,"area":null},{"id":"2512.03419","title":"Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis","created":"2025-12-03","cited_by_count":0,"area":null},{"id":"2512.20915","title":"Towards a General Framework for Predicting and Explaining the Hardness of Graph-based Combinatorial Optimization Problems using Machine Learning and Association Rule Mining","created":"2025-12-24","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":"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":"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}