2007 |
24 | EE | Jos C. M. Baeten,
Jan Karel Lenstra,
Gerhard J. Woeginger:
Preface.
Theor. Comput. Sci. 379(3): 305 (2007) |
2005 |
23 | EE | J. M. Spitter,
Cor A. J. Hurkens,
Ton G. de Kok,
Jan Karel Lenstra,
E. G. Negenman:
Linear programming models with planned lead times for supply chain operations planning.
European Journal of Operational Research 163(3): 706-720 (2005) |
22 | EE | Ann Vandevelde,
Han Hoogeveen,
Cor A. J. Hurkens,
Jan Karel Lenstra:
Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop.
INFORMS Journal on Computing 17(3): 305-320 (2005) |
2004 |
21 | EE | Willem de Paepe,
Jan Karel Lenstra,
Jiri Sgall,
René A. Sitters,
Leen Stougie:
Computer-Aided Complexity Classification of Dial-a-Ride Problems.
INFORMS Journal on Computing 16(2): 120-132 (2004) |
20 | EE | Wenci Yu,
Han Hoogeveen,
Jan Karel Lenstra:
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard.
J. Scheduling 7(5): 333-348 (2004) |
2003 |
19 | | Jos C. M. Baeten,
Jan Karel Lenstra,
Joachim Parrow,
Gerhard J. Woeginger:
Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings
Springer 2003 |
18 | EE | Tjark Vredeveld,
Jan Karel Lenstra:
On local search for the generalized graph coloring problem.
Oper. Res. Lett. 31(1): 28-34 (2003) |
2002 |
17 | EE | Koen M. J. De Bontridder,
B. J. Lageweg,
Jan Karel Lenstra,
James B. Orlin,
Leen Stougie:
Branch-and-Bound Algorithms for the Test Cover Problem.
ESA 2002: 223-233 |
2000 |
16 | | S. R. Tiourine,
Cor A. J. Hurkens,
Jan Karel Lenstra:
Local search algorithms for the radio link frequency assignment problem.
Telecommunication Systems 13(2-4): 293-314 (2000) |
1998 |
15 | EE | Rob J. M. Vaessens,
Emile H. L. Aarts,
Jan Karel Lenstra:
A local search template.
Computers & OR 25(11): 969-979 (1998) |
1997 |
14 | EE | Jan H. M. Korst,
Emile H. L. Aarts,
Jan Karel Lenstra:
Scheduling Periodic Tasks with Slack.
INFORMS Journal on Computing 9(4): 351-362 (1997) |
1996 |
13 | | Jan Karel Lenstra,
Marinus Veldhorst,
Bart Veltman:
The Complexity of Scheduling Trees with Communication Delays.
J. Algorithms 20(1): 157-173 (1996) |
1994 |
12 | EE | Jan H. M. Korst,
Emile H. L. Aarts,
Jan Karel Lenstra,
Jaap Wessels:
Periodic Assignment and Graph Colouring.
Discrete Applied Mathematics 51(3): 291-305 (1994) |
1993 |
11 | | Jan Karel Lenstra,
Marinus Veldhorst:
The Complexity of Scheduling Trees with Communication Delays (Extended Abstract).
ESA 1993: 284-294 |
10 | EE | Gerard A. P. Kindervater,
Jan Karel Lenstra,
Martin W. P. Savelsbergh:
Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem.
Discrete Applied Mathematics 42(2): 211-225 (1993) |
1992 |
9 | | Rob J. M. Vaessens,
Emile H. L. Aarts,
Jan Karel Lenstra:
A Local Search Template.
PPSN 1992: 67- |
1991 |
8 | | Jan H. M. Korst,
Emile H. L. Aarts,
Jan Karel Lenstra,
Jaap Wessels:
Periodic Multiprocessor Scheduling.
PARLE (1) 1991: 166-178 |
1990 |
7 | | Jan Karel Lenstra,
David B. Shmoys,
Éva Tardos:
Approximation Algorithms for Scheduling Unrelated Parallel Machines.
Math. Program. 46: 259-271 (1990) |
6 | | Bart Veltman,
B. J. Lageweg,
Jan Karel Lenstra:
Multiprocessor scheduling with communication delays.
Parallel Computing 16(2-3): 173-182 (1990) |
1989 |
5 | | Gerard A. P. Kindervater,
Jan Karel Lenstra,
David B. Shmoys:
The Parallel Complexity of TSP Heuristics.
J. Algorithms 10(2): 249-270 (1989) |
1987 |
4 | | Jan Karel Lenstra,
David B. Shmoys,
Éva Tardos:
Approximation Algorithms for Scheduling Unrelated Parallel Machines
FOCS 1987: 217-224 |
1982 |
3 | | B. J. Lageweg,
Jan Karel Lenstra,
A. H. G. Rinnooy Kan:
Computer-Aided Complexity Classification of Combinatorial Problems.
Commun. ACM 25(11): 817-822 (1982) |
2 | | Katsuto Nakajima,
S. Louis Hakimi,
Jan Karel Lenstra:
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines.
SIAM J. Comput. 11(3): 512-520 (1982) |
1980 |
1 | | Eugene L. Lawler,
Jan Karel Lenstra,
A. H. G. Rinnooy Kan:
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms.
SIAM J. Comput. 9(3): 558-565 (1980) |