Rainer Burkard

From Wikipedia, the free encyclopedia

Rainer Ernst Burkard (born 28 January 1943, Graz, Austria ) is an Austrian mathematician. His research interests include discrete optimization, graph theory, applied discrete mathematics, and applied number theory.[1][2]

He earned his Ph.D. from the University of Vienna in 1967 and received his habilitation from the University of Graz in 1971. From 1973–1981 Rainer Burkard was full professor of Applied Mathematics at the University of Cologne (Germany). Since 1981 Rainer Burkard is full professor with the Graz University of Technology.

Positions held[edit]

Awards[edit]

Books[edit]

  • Methoden der ganzzahligen Optimierung, Springer Wien, 1972
  • with Ulrich Derigs: Assignment and Matching Problems: Solution Methods with FORTRAN- Programs. Lecture Notes in Economics and Mathematical Systems, Band 184, Berlin-New York: Springer 1980.
  • Graph Algorithms in Computer Science. HyperCOSTOC Computer Science, Vol. 36, Hofbauer Publ., Wiener Neustadt, 1989.
  • With Mauro Dell' Amico and Silvano Martello: Assignment Problems, SIAM, Philadelphia, 2009. ISBN 978-0-89871-663-4

References[edit]