Linear Assignment Problem
You can download algorithms for several variants of the Linear Assignment problem, solved according to
R. Jonker and A. Volgenant
(University of Amsterdam)
"A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems", Computing 38, 325-340 (1987)
These codes are made available in the hope that they will be useful, but without any warranty. Also, we cannot accept any responsibility for their use.
The codes are available only for non-commercial use. Please contact MagicLogic for commercial application.
All these codes are Copyright © 2003-2008 MagicLogic Systems Inc., Canada.
For further technical information, please contact A. Volgenant at the University of Amsterdam by email.
12 April, 2004