具有中等大小集的记忆效率加权集分配

I'm trying to match (linear assigment) two sets of elements according to some weight(i,j) function. I used munkres until now but the amount of memory used by the result alone (15000 x 15000 x sizeof(float)) is too big. My next bet would be the auction algorithm, but I'm not sure if it fits my criteria.I'm trying to match (linear assigment) two sets