Full name: Jan Karel Lenstra
Formal name: Prof.dr. J.K. Lenstra
Function: CWI-Fellow
Email: Jan.Karel.Lenstra@cwi.nl
Telephone: +31(0)20 592 4089
Room: M339
Research groups: Networks and Optimization
Formal name: Prof.dr. J.K. Lenstra
Function: CWI-Fellow
Email: Jan.Karel.Lenstra@cwi.nl
Telephone: +31(0)20 592 4089
Room: M339
Research groups: Networks and Optimization
Research
Combinatorial optimization, in particular computational complexity, design and analysis of approximation algorithms and local search methods.
Career
| 2013 | CWI Fellow PNA1 - Algorithms, Combinatorics and Optimization |
| 2011 - 2012 | CWI Fellow PNA1 - Algorithms, Combinatorics and Optimization |
| 2003 - 2011 | General Director DIR - Directie |
| 1999 - 2002 | Dean of Mathematics and Computer Science, Eindhoven University of Technology |
| 1997 - 2001 | Scientific staff member PNA1 - Algorithms, Combinatorics and Optimization |
| 1983 - 2012 | Professor University of Tilburg, Erasmus University, Eindhoven University of Technology, Georgia Institute of Technology |
| 1976 | PhD, University of Amsterdam |
| 1969 - 1989 | Researcher BS1 - Combinatorial Optimization and Algorithmics |
Selected Awards and Honours
| 2004 | INFORMS Fellow |
| 2003 | IFORS Distinguished Lecturer |
| 1997 | EURO Gold Medal |
| 1996 | Harold Larnder Memorial Prize |
| 1994 | Paul Naor Lecturer |
Selected Academic Activities
| 2009 - 2012 | Editor-in-chief Journal: Surveys in Operations Research and Management Science |
| 2009 - 2010 | Chairman KNAW, Amsterdam - Committee on Mathematics in Primary Education |
| 2008 - | Member of the board KNAW, Amsterdam - Council for Sciences and Engineering |
| 2002 - | Editor-in-chief Journal: Operations Research Letters |
| 1999 - 2001 | Chair Koninklijk Wiskundig Genootschap - [KWG] |
| 1993 - 1998 | Editor-in-chief Journal: Mathematics of Operations Research |
| 1992 - 1995 | Chair Mathematical Programming Society - [MPS] |
| 1987 - 1993 | Founding chair Landelijk Netwerk Mathematische Besliskunde - [LNMB] |
Selected Publications
| K.M.J. De Bontridder, B.V. Halldórsson, M.M. Halldórsson, C.A.J. Hurkens, J.K. Lenstra, R. Ravi, L. Stougie. Approximation algorithms for the test cover problem. Mathematical Programming Series B 98, 477–492, 2003. |
| D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast'janov, D.B. Shmoys. Short shop schedules. Operations Research 45, 288–294, 1997. |
| E.H.L. Aarts(editor), J.K. Lenstra(editor). Local Search in Combinatorial Optimization. Wiley, Chichester. 1997. |
| J.K. Lenstra, D.B. Shmoys, É. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46, 259–271, 1990. |
| E.L. Lawler(editor), J.K. Lenstra(editor), A.H.G. Rinnooy Kan(editor), D.B. Shmoys(editor). The Traveling Salesman Problem; A Guided Tour of Combinatorial Optimization. Wiley, Chichester. 1985. |
| M.A.H. Dempster, M.L. Fisher, L. Jansen, B.J. Lageweg, J.K. Lenstra, A.H.G. Rinnooy Kan. Analysis of heuristics for stochastic programming: results for hierarchical scheduling problems. Mathematics of Operations Research 8, 525–537, 1983. |
| E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan. Generating all maximal independent sets; NP-hardness and polynomial-time algorithms. SIAM Journal on Computing 9, 558–565, 1980. |
| R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287–326, 1979. |
| J.K. Lenstra, A.H.G. Rinnooy Kan, P. Bruckner. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, 343–362, 1977. |
