combinatorial optimization 1graphical models 1tour decoding 1traveling salesman problem 1unsupervised learning 1
From the 1 of 3 linked papers with an AI index.
3 papers
cs.AI2026
Connected by Construction: Learning Tractable Near-Tour Marginals for Traveling Salesman Problems
Ke Sun, Xinyuan Zhang, Xinwu Qian
The paper introduces C2TSP, an unsupervised learning framework that directly models near‑tour edge marginals for the traveling salesman problem using a connected‑by‑construction 1‑…
cs.LG2026
Neural Certificate Pricing for Combinatorial Optimization Problems
Jingyi Chen, Xinyuan Zhang, Xinwu Qian
Combinatorial optimization (CO) problems are difficult because certifiable discrete structure induces exponential search. One needs to search over the set exponentially many candid…
cs.LG2025
Unsupervised Learning for the Elementary Shortest Path Problem
Jingyi Chen, Xinyuan Zhang, Xinwu Qian
The Elementary Shortest-Path Problem(ESPP) seeks a minimum cost path from s to t that visits each vertex at most once. The presence of negative-cost cycles renders the problem NP-h…