How to use Jonker's LAP Linear Assigment Prolem code
Posted on 2006-11-04
I'd appreciate any help on how to use Jonker's LAP, something like an "user guide" or some samples.
The only info I have is inside the code itself:
version 1.0 - 4 September 1996
author: Roy Jonker @ MagicLogic Optimization Inc.
Code for Linear Assignment Problem, according to
"A Shortest Augmenting Path Algorithm for Dense and Sparse Linear
Assignment Problems," Computing 38, 325-340, 1987
R. Jonker and A. Volgenant, University of Amsterdam.
Unfortunatelly there is no information about LAP at those organizations' sites anymore.
I'd like to apply LAP in place of the simple DFS I used in my branch-and-bound CVRP solver.
Please note this is not homework. I have already done my assignments at my graduate course, when I used DFS and a LP version with the huge SYMPHONY package in similar problems. What I'm like now is a light solution by using public domain software.
Thanks in advance,