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

Sanne Wøhlk, Gilbert Laporte. Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs. Computers & OR, 87:107-113, 2017. [doi]

Abstract

Abstract is missing.