Xref: utzoo comp.misc:8891 comp.theory:654 comp.sys.ibm.pc:49990
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!venera.isi.edu!pi
From: pi@maserati.isi.edu (Jen-I Pi)
Newsgroups: comp.misc,comp.theory,comp.sys.ibm.pc
Subject: Re: Ref for Jonker-Volgenant algorithm wanted.
Message-ID: <13263@venera.isi.edu>
Date: 4 May 90 03:41:50 GMT
References: <6518@titan.camcon.co.uk>
Sender: news@venera.isi.edu
Reply-To: pi@maserati.isi.edu (Jen-I Pi)
Organization: USC-Information Sciences Institute
Lines: 20

In article <6518@titan.camcon.co.uk>, mrh@camcon.co.uk (Mark Hughes) writes:
> Can anyone give me a reference describing the Jonker-Volgenant algorithm?
> 
> Apparantly it is
> 
> 	a method for solving "large assignment" problems, such as
> 	the matching of 1,000 people to 1,000 jobs.
> 	(The Grauniad newspaper 3 May 1990).
> 
> and so is of interest to me. Please email replies.
> 

"A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment
 Problems" by R. Jonker and A. Volgenant, Computing 38, pp. 325-340 (1987).

Jen-I pi@vlsi-cad.isi.edu :-)
MOSIS Project, USC/ISI
4676 Admiralty way
Marina del Rey, CA 90292-6695
(213)822-1511 x707