| Article ID: | iaor1988207 |
| Country: | Switzerland |
| Volume: | 13 |
| Start Page Number: | 225 |
| End Page Number: | 261 |
| Publication Date: | Aug 1988 |
| Journal: | Annals of Operations Research |
| Authors: | Derigs Ulrich |
| Keywords: | networks |
The paper describes a matching code which is based on an efficient labeling technique to solve the path problem arising from a formulation of the minimum cost-perfect matching problem. Computational results and a FORTRAN code are given.