mrh@camcon.co.uk (Mark Hughes) (05/03/90)
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. Thanks in advance. Mark -- ---------------- Eml: mrh@camcon.co.uk or mrh@camcon.uucp | Mark Hughes | Tel: +44 (0) 223 420024 Cambridge Consultants Ltd. |(Compware & CCL)| Fax: +44 (0) 223 423373 The Science Park, Milton Road, ---------------- Tlx: 81481 (CCL G) Cambridge, UK. (Me, an opinion?)
pi@maserati.isi.edu (Jen-I Pi) (05/04/90)
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