Jan Karel Lenstra

Jan Karel Lenstra (born December 19, 1947 in Zaandam ) is a Dutch mathematician.

Jan Karel Lenstra, Oberwolfach 2011

Lenstra received his PhD in 1976 from Gijsbert de Leve at the University of Amsterdam (Sequencing by enumerative methods). He was at the Centrum Wiskunde & Informatica (CWI) until 1989 , then Professor at the University of Tilburg, the University of Rotterdam, the TU Eindhoven (and there from 1999 to 2002 Dean of the Faculty of Mathematics and Computer Science), at the Georgia Institute of Technology and 2003 to 2011 Director of the CWI. From 2001 he was a CWI Fellow.

Lenstra was editor of Mathematics of Operations Research and from 2002 of Operations Research Letters. In 2011 he became a Knight of the Dutch Lion. In 2004 he became an Informs Fellow. 1992 to 1995 he was chairman of the Mathematical Programming Society (MPS).

Among other things, he dealt with combinatorial optimization (including questions of complexity), scheduling algorithms, the traveling salesman problem and local search in optimization.

He is the brother of Arjen Lenstra and Hendrik Lenstra .

Fonts

• with Koen MJ De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor AJ Hurkens, Ramamoorthi Ravi, Leen Stougie: Approximation algorithms for the test cover problem. In: Mathematical Programming . Series B, Volume 98, 2003, pp. 477-491, doi : 10.1007 / s10107-003-0414-6 .
• with David P. Williamson , Leslie A. Hall, JA Hoogeveen, Cor AJ Hurkens, Sergey V. Sevast'janov, David B. Shmoys : Short shop schedules. In: Operations Research . Volume 45, No. 2, 1997, pp. 288-294, doi : 10.1287 / opre.45.2.288 .
• with David B. Shmoys, Éva Tardos : Approximation algorithms for scheduling unrelated parallel machines. In: Mathematical Programming. Volume 46, 1990, pp. 259-271, doi : 10.1007 / BF01585745 .
• as editor with Eugene L. Lawler , Alexander HG Rinnooy Kan , David B. Shmoys: The traveling salesman problem. A guided tour of combinatorial optimization. Wiley, Chichester et al. 1985, ISBN 0-471-90413-9 .
• with Michael AH Dempster, Marshall L. Fisher, L. Jansen, BJ Lageweg, Alexander HG Rinnooy Kan: Analysis of heuristics for stochastic programming: results for hierarchical scheduling problems. In: Mathematics of Operations Research . Volume 8, No. 4, 1983, pp. 525-537, doi : 10.1287 / moor.8.4.525 .
• with Eugene L. Lawler, Alexander HG Rinnooy Kan: Generating all maximally independent sets: NP-hardness and polynomial-time algorithms. In: SIAM Journal on Computing. Volume 9, No. 3, 1980, pp. 558-565, doi : 10.1137 / 0209042 .
• with Ronald L. Graham , Eugene L. Lawler, Alexander HG Rinnooy Kan: Optimization and approximation in deterministic sequencing and scheduling: A survey. In: Peter L. Hammer , Ellis L. Johnson , Bernhard H. Korte (Eds.): Discrete Optimization II. Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver August 1-31, 1977 (= Annals of Discrete Mathematics. Volume 5). North-Holland, Amsterdam 1979, pp. 287-326, doi : 10.1016 / S0167-5060 (08) 70356-X .
• with Alexander HG Rinnooy Kan, Peter Brucker: Complexity of machine scheduling problems . In: Annals of Discrete Mathematics. Volume 1, 1977, pp. 343-362, doi : 10.1016 / S0167-5060 (08) 70743-X .

Web links

• biography
• Page at the CWI

Individual evidence

1. ↑ Jan Karel Lenstra in the Mathematics Genealogy Project (English)
2. ↑ Informs Fellows 2004, with photo ( memento of the original dated February 22, 2014 in the Internet Archive ) Info: The archive link has been inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice.