A celebration day of the 50th anniversary
of the Hungarian Method

Harold W. Kuhn published his seminal paper The Hungarian method for the assignment problem in 1955. To commemorate this anniversary, the Egerváry Research Group (EGRES) of the Hungarian Academy of Sciences organized a celebration day in Budapest. The gathering was held in the building of the Academy (H-1051 Budapest, Roosevelt tér 9, felolvasó terem) on October 31, 2005.

For photos click here.

The program was as follows.  

 
9.30 opening
10.00

Harold W. Kuhn

 Reflections on a favorite child
10.30

Alexander Schrijver

 Open problems in polyhedral combinatorics
11.00

William R. Pulleyblank

 Alternating paths and US patent #5,905,666
11.30 coffee break
12.00

Jack Edmonds

 Egerváry-type theorems and polymatroid intersection
12.30

Éva Tardos

 Hungarian Method in approximation algorithms and games
13.00 lunch break
15.00

Martin Grötschel

 Vehicle circulation and the Hungarian Method
15.30

András Sebő

 Ways to matching generalizations
16.00

Bernhard Korte

 Multi-commodity- and min-cost-flow-approaches in VLSI-design
16.30 coffee break
17.00

Gyula Pap

 A new approach to alternating paths
17.30

László Lovász

 Matchings and their structure
18.30 reception
 

Supported by:

Hungarian Academy of Sciences, Section of Mathematics

Inter-University Centre for Telecommunications and Informatics (ETIK)

Hungarian Academy of Sciences, Committee on Operational Research

Hungarian Operational Research Society
This page has been accessed 9498 times since May 2005.
Last modification: 26.10.2005.