J. H. Boutet de Monvel

Learn More
Given two sets of N points X={X1, . . . ,XN} and Y ={Y1, . . . ,YN} in Rd, a bipartite matching of X and Y is a perfect matching M on the set X ∪Y , such that each pair in M is made of one point of X and one point of Y . The length of such a matching is defined to be the sum of the euclidean lengths of the edges formed by its pairs. The (euclidean) minimum(More)
The traveling salesman problem (TSP) consists of finding the length of the shortest closed tour visiting N "cities". We consider the Euclidean TSP where the cities are distributed randomly and independently in a d-dimensional unit hypercube. Working with periodic boundary conditions and inspired by a remarkable universality in the kth nearest neighbor(More)
  • 1