The Hungarian method_ Solving efficiently the Assignment problem by malj


									The Hungarian method: Solving efficiently the Assignment problem.

The file is an old 16 bits graphic implementation of the Hungarian method. It
shows the alternating paths, the augmenting paths and the algorithm “in execution”.
The data for this program is the text file hung.20.
The file hung50 is an output of the same program for a 50x50 assignment problem.
The program (an old 16 bits version) will solve assignments problems. It can
read input from a file or create its own random data file. The output will be written to a
file called hung.out. The file hung.50 is a sample output of this program.

To top