Jan Karel Lenstra

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

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

Lenstra was editor of Mathematics of Operations Research, and from 2002 Operations Research Letters. In 2011 he was knight of the Netherlands Lion. In 2004 he was Informs Fellow. 1992 to 1995 he was chairman of the Mathematical Programming Society ( MPS).

It dealt among other things with combinatorial optimization (including complexity issues ), scheduling algorithms, the Travelling Salesman Problem and Local Search in optimization.

He is the brother of Arjen Lenstra and Hendrik Lenstra.

Writings

  • With KMJ De Bontridder, BV Halldórsson, MM Halldórsson, CAJ Hurkens, R. Ravi, L. Stougie: Approximation algorithms for the test cover problem, in: Mathematical Programming, Series B 98, 2003, pp. 477-492
  • With DP Williamson, LA Hall, JA Hoogeveen, CAJ Hurkens, SV Sevastjanov, DB Shmoys: Short shop schedules. In: Operations Research 45, 1997, pp. 288-294
  • DB Shmoys, Éva Tardos: Approximation algorithms for scheduling unrelated parallel machines. In: Mathematical Programming 46, 1990, pp. 259-271
  • With MAH Dempster, ML Fisher, L. Jansen, BJ Lageweg, AHG Rinnooy Kan: Analysis of heuristics for stochastic programming: results for hierarchical scheduling problems. In: Mathematics of Operations Research 8, 1983, pp. 525-537
  • With EL Lawler, AHG Rinnooy Kan: Generating all maximal independent sets; NP- hardness and polynomial -time algorithms. In: SIAM Journal on Computing 9, 1980, pp. 558-565
  • RL Graham, EL Lawler, AHG Rinnooy Kan: Optimization and approximation in deterministic sequencing and scheduling: A survey. In: Annals of Discrete Mathematics 5, 1979, pp. 287-326
  • AHG Rinnooy Kan with, Brucker P.: Complexity of machine scheduling problems. In: Annals of Discrete Mathematics 1, 1977, p 343-362
  • With Eugene Lawler, Alexander Rinnooy Kan, David Shmoys: The traveling salesman problem - a guided tour of combinatorial optimization, Wiley 1985
Scheduling (computing) Local search (optimization) Mathematics Genealogy Project Integrated Authority File
430298
de