combinatorial optimization 1graphical models 1tour decoding 1traveling salesman problem 1unsupervised learning 1
From the 1 of 2 linked papers with an AI index.
2 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‑…
math.CO2026
From a Voucher Puzzle to Extremal Sums of Adjacent Products
Chris Chen, Vivian Chen, Ray Cui +10
Motivated by a self-referential puzzle, we study sequences of voucher price tags in which each choice multiplies the cost of the following one. We connect the puzzle setting to cla…