Linear Bottleneck Assignment
Problem  Freeware
Code
LAPJVBOT: Jonker and Volgenant (direct download)

This code is a straightforward transformation of
LAPJV, and is based on the algorithm described in
R. Jonker and A. Volgenant, A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems,
Computing 38, 325340, 1987.
The choice of the constant inf has to be such that it is much larger than the largest cost coefficient.
The cost matrix is defined for integers. Defining it 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.
Comments and remarks on the use of the algorithms are appreciated by the authors. Contact A.Volgenant@uva.nl 




Code LAPJVBOT 



Download size: 2 Kb 

Language: Pascal 
