Finding a cheap matching
T.H.C. Smith · Unisa Institutional Repository (University of South Africa) · 1988
We propose an edge exchange algorithm/or finding a cheaper 1-matchingfrom a given ]-matching as well as a heuristic algorithm/or constructing a relatively cheap ]-matching from the optimal solution of a relaxation of the ]-matching problem. Computational experience with these two algorithms as well as two greedy algorithms from the literature is reported.