Jan Karel Lenstra

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Jan Karel Lenstra (born 19 December 1947, in Zaandam) is a Dutch mathematician and operations researcher, known for his work on scheduling algorithms, local search, and the travelling salesman problem.

Lenstra received his Ph.D. from the University of Amsterdam in 1976, advised by Gijsbert de Leve.[1] He then became a researcher at the Centrum Wiskunde & Informatica, where he remained until 1989. After taking positions at the Eindhoven University of Technology (where he became Dean of the Faculty of Mathematics and Computer Science) and the Georgia Institute of Technology, he returned to CWI as its director in 2003. He stepped down in 2011, and at that time became a CWI Fellow.[2] He was editor-in-chief of Mathematics of Operations Research from 1993 to 1998, and is editor-in-chief of Operations Research Letters since 2002.[3][4]

Lenstra became an INFORMS fellow in 2004.[5] In 2011, he was made a knight of the Order of the Netherlands Lion,[2] and the CWI organized a symposium in his honor.[6]

Lenstra is the brother of Arjen Lenstra, Andries Lenstra, and Hendrik Lenstra, all of whom are also mathematicians.

References[edit]

  1. ^ Jan Karel Lenstra at the Mathematics Genealogy Project.
  2. ^ a b Royal Decoration for Former CWI Director Jan Karel Lenstra, Centrum Wiskunde & Informatica, November 4, 2011 .
  3. ^ Faculty profile, CWI, retrieved 2011-11-08.
  4. ^ Editorial board, Operations Research Letters, retrieved 2011-11-08.
  5. ^ INFORMS Fellows: Class of 2004, INFORMS, retrieved 2011-11-08.
  6. ^ Jan Karel Lenstra: the traveling science man, CWI, retrieved 2011-11-08.