| Optimization and approximation in deterministic sequencing and scheduling: a survey RL Graham, EL Lawler, JK Lenstra, AHGR Kan Annals of discrete mathematics 5, 287-326, 1979 | 8039 | 1979 |
| The traveling salesman problem: a guided tour of combinatorial optimization EL Lawler Wiley-Interscience Series in Discrete Mathematics, 1985 | 5121 | 1985 |
| Complexity of machine scheduling problems JK Lenstra, AHGR Kan, P Brucker Annals of discrete mathematics 1, 343-362, 1977 | 2962 | 1977 |
| Sequencing and scheduling: Algorithms and complexity EL Lawler, JK Lenstra, AHGR Kan, DB Shmoys Handbooks in operations research and management science 4, 445-522, 1993 | 2359 | 1993 |
| Scheduling subject to resource constraints: classification and complexity J Blazewicz, JK Lenstra, AHGR Kan Discrete applied mathematics 5 (1), 11-24, 1983 | 2128 | 1983 |
| Complexity of vehicle routing and scheduling problems JK Lenstra, AHGR Kan Networks 11 (2), 221-227, 1981 | 1995 | 1981 |
| Job shop scheduling by simulated annealing PJM Van Laarhoven, EHL Aarts, JK Lenstra Operations research 40 (1), 113-125, 1992 | 1709 | 1992 |
| Approximation algorithms for scheduling unrelated parallel machines JK Lenstra, DB Shmoys, É Tardos Mathematical programming 46, 259-271, 1990 | 1300 | 1990 |
| Complexity of scheduling under precedence constraints JK Lenstra, AHG Rinnooy Kan Operations Research 26 (1), 22-35, 1978 | 893 | 1978 |
| Deterministic production planning: Algorithms and complexity M Florian, JK Lenstra, AHG Rinnooy Kan Management science 26 (7), 669-679, 1980 | 890 | 1980 |
| The complexity of the network design problem DS Johnson, JK Lenstra, AHGR Kan Networks 8 (4), 279-285, 1978 | 591 | 1978 |
| Job shop scheduling by local search RJM Vaessens, EHL Aarts, JK Lenstra Informs Journal on computing 8 (3), 302-317, 1996 | 493 | 1996 |
| Some simple applications of the travelling salesman problem JK Lenstra, AHGR Kan Journal of the Operational Research Society 26 (4), 717-733, 1975 | 492 | 1975 |
| Computational complexity of discrete optimization problems JK Lenstra, AHGR Kan Annals of discrete mathematics 4, 121-140, 1979 | 464 | 1979 |
| Vehicle routing with time windows: optimization and approximation M Desrochers, JK Lenstra, MWP Savelsbergh, F Soumis CWI. Department of Operations Research and System Theory [BS], 1987 | 452 | 1987 |
| Recent developments in deterministic sequencing and scheduling: a survey EL Lawler, JK Lenstra, AHG Rinnooy Kan Deterministic and Stochastic Scheduling: Proceedings of the NATO Advanced …, 1982 | 444 | 1982 |
| Generating all maximal independent sets: NP-hardness and polynomial-time algorithms EL Lawler, JK Lenstra, AHG Rinnooy Kan SIAM Journal on Computing 9 (3), 558-565, 1980 | 374 | 1980 |
| On general routing problems JK Lenstra, AHGR Kan Networks 6 (3), 273-280, 1976 | 367 | 1976 |
| A computational study of local search algorithms for job shop scheduling EHL Aarts, PJM van Laarhoven, JK Lenstra, NLJ Ulder ORSA Journal on Computing 6 (2), 118-125, 1994 | 351 | 1994 |
| Scheduling theory and its applications P Chretienne, EG Coffman Jr, JK Lenstra, Z Liu Journal of the Operational Research Society 48 (7), 764-765, 1997 | 345 | 1997 |
