©
Assignment problem, Hungarian method
  Solves the assignment problem by the Hungarian method.
2024.Jul.03 18:23:45
Cost Cost matrix (integer).
For Big M, supply a negative value (such as −1)

(No character after last value.) •

Solves the assignment problem by the Hungarian method. The base problem is from Peltola (see ref.), giving z* = 275.

Other suggested data (or data.pdf):

z* = 22z* = 950
  8 17  3 23
 39  4 11 20
 13  2 41  6
 22  8  9  2
250 400 350
400 600 350
200 400 250
References: Plate: Hungarian

• Skiena, Steven, "Carpaneto, Martello and Toth's Linear Assignment Problem Software", The Stony Brook Algorithm Repository (State Univ. of New York at Stony Brook).

• Peltola, Matti: Example 1 (=.pdf), z* = 22 (Oulun yliopisto, Oulu University).

• PHUNKEE, Hungarian Method (=.pdf), z* = 275 [Structural Bioinformatics Group, Imperial College, London (UK)].

• 1623-06-19: Pascal, Blaise (1662-08-19).

 
 
Valid HTML 4.01! IST http://web.ist.utl.pt/~ist11038/compute/or/Fx-Hungarian.php
Created: 2010-06-19 — Last modified: 2013-05-01