| Article ID: | iaor20084118 |
| Country: | United Kingdom |
| Volume: | 17 |
| Issue: | 1 |
| Start Page Number: | 95 |
| End Page Number: | 96 |
| Publication Date: | Jan 1990 |
| Journal: | Computers and Operations Research |
| Authors: | Wright M.B. |
A simple modification to the ‘Hungarian’ algorithm for the linear assignment problem reduces execution time by up to 90%.