| Article ID: | iaor1993357 |
| Country: | Netherlands |
| Volume: | 50 |
| Issue: | 1 |
| Start Page Number: | 113 |
| End Page Number: | 121 |
| Publication Date: | Mar 1991 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Derigs U., Metz A. |
| Keywords: | matching |
In this paper the authors describe computational results for a modification of the shortest augmenting path approach for solving large scale matching problems. Using a new assignment start procedure and the two-phase strategy, where first the problem is solved on a sparse subgraph and then reoptimization is used, matching problems on complete graphs with 1000 nodes are solved in about 10-15 seconds on an IBM 4361.