Linear Assignment
Problem  Freeware
Codes
LAPJV and LAPMOD: Jonker and Volgenant (direct download)

These codes are based on, or derived from, the algorithms described in
R. Jonker and A. Volgenant, A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems,
Computing 38, 325340, 1987,
and
A. Volgenant, Linear and Semi Assignment Problems: a core oriented approach,
Computers & Operations Research 23 917932, 1996 (LAPMOD).
The file names adopt the following extensions:
`_C' for versions in Clanguage;
`.F' for versions in Fortran;
`.P' for versions in Pascal.
Some versions are given as functions or as procedures, while others are given in the context of (test) programs.
It is straightforward to transform from function or procedure to program and vice versa.
The choice of the constant inf has to be such that it is much larger than the largest cost coefficient.
The cost matrices are defined for integers. Defining them for reals is possible, although other variable types have to be changed too. Further, a tolerance interval has to be chosen to be used when comparing two real values.
The effect of using real cost values on the speed of the algorithm will depend on the used computer as well as the used computer language.
Comments and remarks on the use of the algorithms are appreciated by the authors. Ton Volgenant has retired, but he can be contacted through the Amsterdam School of of Economics at secretariaatase@uva.nl 




Codes LAP for dense matrices 


Codes LAP for sparse matrices 



Download sizes: 13 Kb, 4Kb 

Languages: Pascal, Fortran, C 
