Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
Wøhlk, Sanne ; Laporte, Gilbert
Computers & operations research, 2017-11, Vol.87, p.107-113
[Periódico revisado por pares]
New York: Elsevier Ltd
Texto completo disponível