Papers
1–3 of 3Research Paper·Mar 12, 2026
UniHetCO: A Unified Heterogeneous Representation for Multi-Problem Learning in Unsupervised Neural Combinatorial Optimization
Unsupervised neural combinatorial optimization (NCO) offers an appealing alternative to supervised approaches by training learning-based solvers without ground-truth solutions, directly minimizing ins...
7.0 viability
Research Paper·Feb 11, 2026
Transport, Don't Generate: Deterministic Geometric Flows for Combinatorial Optimization
Recent advances in Neural Combinatorial Optimization (NCO) have been dominated by diffusion models that treat the Euclidean Traveling Salesman Problem (TSP) as a stochastic $N \times N$ heatmap genera...
3.0 viability
Research Paper·Mar 17, 2026
Domain-Independent Dynamic Programming with Constraint Propagation
There are two prevalent model-based paradigms for combinatorial problems: 1) state-based representations, such as heuristic search, dynamic programming (DP), and decision diagrams, and 2) constraint a...
2.0 viability