Carlo Lucibello — Politecnico di Torino #
Scaling hypothesis for the Euclidean bipartite matching problem #
The matching problem is a long standing problem in combinatorial optimization that has attracted many 
attentions in the disordered systems community. In the Euclidean version of the problem the cost matrix is 
given by the distances among points randomly distributed in the d-dimensional box. Here we present a 
simple approximation for the Euclidean bipartite matching, based on the Poisson equation, that leads to 
several prediction on the exact limit value of the average optimal cost.