2 papers
cs.AI2026
Connected by Construction: Learning Tractable Near-Tour Marginals for Traveling Salesman Problems
Ke Sun, Xinyuan Zhang, Xinwu Qian
Learning-based methods for the traveling salesman problem (TSP) are often evaluated through the tours produced after decoding or search, but the learned object itself frequently li…
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…