Enrico Maria Fenoaltea

Information-theoretic formulation of the Traveling Salesman Problem

This paper proposes a general approach for handling hard constraints while reducing hard combinatorial optimization problems to simpler ones, and derives a mean-field approximation in terms of edge occupancies and implement a differentiable cycle penalty that suppresses sub-tours.