. . . . . . . . . . . . . "Jan Karel Lenstra"@fr . . . . . "\u064A\u0627\u0646 \u0643\u0627\u0631\u064A\u0644 \u0644\u0646\u0633\u062A\u0631\u0627"@ar . . . "Jan Karel Lenstra"@de . "33685896"^^ . "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. 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. 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. Lenstra became an INFORMS fellow in 2004.In 1997, he was awarded the EURO Gold Medal, the highest distinction within Operations Research in Europe.In 2011, he was made a knight of the Order of the Netherlands Lion, and the CWI organized a symposium in his honor. Lenstra is the brother of Arjen Lenstra, Andries Lenstra, and Hendrik Lenstra, all of whom are also mathematicians. He is married to Karen Aardal, in 2020 professor at Delft University."@en . . . . . . . . . . . . . . . . . . . . . . . . . . "4167"^^ . . . . . "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 became an INFORMS fellow in 2004.In 1997, he was awarded the EURO Gold Medal, the highest distinction within Operations Research in Europe.In 2011, he was made a knight of the Order of the Netherlands Lion, and the CWI organized a symposium in his honor."@en . . . . . "Jan Karel Lenstra (n\u00E9 le 19 d\u00E9cembre 1947 \u00E0 Zaandam) est un math\u00E9maticien n\u00E9erlandais sp\u00E9cialiste en recherche op\u00E9rationnelle, connu pour ses travaux sur l'ordonnancement dans les syst\u00E8mes d'exploitation, la recherche locale, et le probl\u00E8me du voyageur de commerce. Lenstra est fr\u00E8re d'Arjen Lenstra, Andries Lenstra, et Hendrik Lenstra, tous math\u00E9maticiens."@fr . . "Jan Karel Lenstra (n\u00E9 le 19 d\u00E9cembre 1947 \u00E0 Zaandam) est un math\u00E9maticien n\u00E9erlandais sp\u00E9cialiste en recherche op\u00E9rationnelle, connu pour ses travaux sur l'ordonnancement dans les syst\u00E8mes d'exploitation, la recherche locale, et le probl\u00E8me du voyageur de commerce. Lenstra est fr\u00E8re d'Arjen Lenstra, Andries Lenstra, et Hendrik Lenstra, tous math\u00E9maticiens."@fr . . . . . . . . . . . . . . "Jan Karel Lenstra (* 19. Dezember 1947 in Zaandam) ist ein niederl\u00E4ndischer Mathematiker. Lenstra wurde 1976 bei Gijsbert de Leve an der Universit\u00E4t Amsterdam promoviert (Sequencing by enumerative methods). Er war bis 1989 am Centrum Wiskunde & Informatica (CWI), danach Professor an der Universit\u00E4t Tilburg, der Universit\u00E4t Rotterdam, der TU Eindhoven (und dort 1999 bis 2002 Dekan der Fakult\u00E4t f\u00FCr Mathematik und Informatik), am Georgia Institute of Technology und 2003 bis 2011 Direktor des CWI. Ab 2001 war er CWI Fellow. Lenstra war Herausgeber von Mathematics of Operations Research und ab 2002 von Operations Research Letters. 2011 wurde er Ritter vom Niederl\u00E4ndischen L\u00F6wen. 2004 wurde er Informs Fellow. 1992 bis 1995 war er Vorsitzender der Mathematical Programming Society (MPS). Er befasste sich unter anderem mit Kombinatorischer Optimierung (unter anderem Komplexit\u00E4tsfragen), Scheduling-Algorithmen, dem Travelling Salesman Problem und Lokaler Suche in der Optimierung. Er ist der Bruder von Arjen Lenstra und Hendrik Lenstra."@de . . . "\u064A\u0627\u0646 \u0643\u0627\u0631\u064A\u0644 \u0644\u0646\u0633\u062A\u0631\u0627 (\u0628\u0627\u0644\u0647\u0648\u0644\u0646\u062F\u064A\u0629: Jan Karel Lenstra)\u200F \u0647\u0648 \u0631\u064A\u0627\u0636\u064A\u0627\u062A\u064A \u0647\u0648\u0644\u0646\u062F\u064A\u060C \u0648\u0644\u062F \u0641\u064A 19 \u062F\u064A\u0633\u0645\u0628\u0631 1947 \u0641\u064A \u0632\u0627\u0646\u0633\u062A\u0627\u062F \u0641\u064A \u0647\u0648\u0644\u0646\u062F\u0627."@ar . . "Jan Karel Lenstra (* 19. Dezember 1947 in Zaandam) ist ein niederl\u00E4ndischer Mathematiker. Lenstra wurde 1976 bei Gijsbert de Leve an der Universit\u00E4t Amsterdam promoviert (Sequencing by enumerative methods). Er war bis 1989 am Centrum Wiskunde & Informatica (CWI), danach Professor an der Universit\u00E4t Tilburg, der Universit\u00E4t Rotterdam, der TU Eindhoven (und dort 1999 bis 2002 Dekan der Fakult\u00E4t f\u00FCr Mathematik und Informatik), am Georgia Institute of Technology und 2003 bis 2011 Direktor des CWI. Ab 2001 war er CWI Fellow. Er ist der Bruder von Arjen Lenstra und Hendrik Lenstra."@de . . . "\u064A\u0627\u0646 \u0643\u0627\u0631\u064A\u0644 \u0644\u0646\u0633\u062A\u0631\u0627 (\u0628\u0627\u0644\u0647\u0648\u0644\u0646\u062F\u064A\u0629: Jan Karel Lenstra)\u200F \u0647\u0648 \u0631\u064A\u0627\u0636\u064A\u0627\u062A\u064A \u0647\u0648\u0644\u0646\u062F\u064A\u060C \u0648\u0644\u062F \u0641\u064A 19 \u062F\u064A\u0633\u0645\u0628\u0631 1947 \u0641\u064A \u0632\u0627\u0646\u0633\u062A\u0627\u062F \u0641\u064A \u0647\u0648\u0644\u0646\u062F\u0627."@ar . . . "Jan Karel Lenstra"@en . . . . . . . . "1066340621"^^ . . . . . . . . . . . . .