10 citations · 15 across the 2 of their papers we have counts for
5 papers · 1 filter
Average optimal cost for the Euclidean TSP in one dimension
Sergio Caracciolo, Andrea Di Gioacchino, Enrico M. Malatesta +1
The traveling-salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We stu…
Selberg integrals in 1D random Euclidean optimization problems
Sergio Caracciolo, Andrea Di Gioacchino, Enrico M. Malatesta +1
We consider a set of Euclidean optimization problems in one dimension, where the cost function associated to the couple of points and is the Euclidean distance between them…
Exact value for the average optimal cost of bipartite traveling-salesman and 2-factor problems in two dimensions
Riccardo Capelli, Sergio Caracciolo, Andrea Di Gioacchino +1
We show that the average cost for the traveling-salesman problem in two dimensions, which is the archetypal problem in combinatorial optimization, in the bipartite case, is simply…
Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension
Sergio Caracciolo, Andrea Di Gioacchino, Enrico M. Malatesta
In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen a…
The Random Fractional Matching Problem
Carlo Lucibello, Enrico M. Malatesta, Giorgio Parisi +1
We consider two formulations of the random-link fractional matching problem, a relaxed version of the more standard random-link (integer) matching problem. In one formulation, we a…