| Article ID: | iaor20022482 |
| Country: | United States |
| Volume: | 33 |
| Issue: | 1 |
| Start Page Number: | 29 |
| End Page Number: | 41 |
| Publication Date: | Jan 1999 |
| Journal: | Networks |
| Authors: | Jungnickel Dieter, Fremuth-Paeger Christian |
| Keywords: | graphs |
In previous papers, we discussed the fundamental theory of matching problems and algorithms in terms of a network flow model. In this paper, we present explicit augmentation procedures which apply to the wide range of capacitated matching problems and which are highly efficient for