Carpaneto, Martello and Toth's Linear Assignment Problem Software
These codes implement the Lawler version of the Hungarian algorithm. Both codes consist of a Fortran subroutine that receives the input instance through formal parameters: APC works on a complete cost matrix, while APS works on a sparse instance, provided as a forward star. A very large solution value is returned by APS if the instance does not have a perfect matching.
Download Files (local site)The Assignment Problems webpage
This page last modified on 2008-07-10