35 citations · 51 across the 10 of their papers we have counts for
3 papers · 1 filter
Information-theoretic formulation of the Traveling Salesman Problem
Enrico Maria Fenoaltea, Riccardo Piombo, Aurelio Patelli
The Traveling Salesman Problem (TSP) asks for the shortest route to visit a set of cities exactly once. It combines a simple local rule - each city must be visited once - with a ha…
A Grand-Canonical Solution to a Class of Random Optimization Problems
Izat B Baybusinov, Enrico M Fenoaltea, Zhen Han +1
We introduce a general framework to solve a class of combinatorial opti- mization problems, including the matching problem, the Traveling Salesman Problem, and also the minimum wei…
Anticipating Innovation Using Large Language Models
Enrico Maria Fenoaltea, Filippo Santoro, Giordano De Marzo +2
Forecasting innovation, intended as the emergence of new technological combinations, is a fundamental challenge for science and policy. We show that forthcoming combinations leave…