Connected by Construction: Learning Tractable Near-Tour Marginals for Traveling Salesman Problems

This study explores the underlying Hamiltonian structures learned by machine learning models before decoding when solving the traveling salesman problem.

Firefly links to the original publisher. The summary above is AI-generated for orientation and may differ from the source. The “current rank score” decays over time so newer significant stories surface first.