Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs