| 2003 |
|---|
| 9 | EE | A. H. G. Rinnooy Kan:
Managing a multi-billion dollar IT Budget.
ICSM 2003: 2- |
| 1994 |
|---|
| 8 | EE | Antoon W. J. Kolen,
A. H. G. Rinnooy Kan,
C. P. M. van Hoesel,
Albert P. M. Wagelmans:
Sensitivity Analysis of List Scheduling Heuristics.
Discrete Applied Mathematics 55(2): 145-162 (1994) |
| 1993 |
|---|
| 7 | EE | A. H. G. Rinnooy Kan,
Leen Stougie,
Carlo Vercellis:
A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem.
Discrete Applied Mathematics 42(2): 279-290 (1993) |
| 1991 |
|---|
| 6 | | János Csirik,
J. B. G. Frenk,
Gábor Galambos,
A. H. G. Rinnooy Kan:
Probabilistic Analysis of Algorithms for Dual Bin Packing Problems.
J. Algorithms 12(2): 189-203 (1991) |
| 1990 |
|---|
| 5 | | M. Meanti,
A. H. G. Rinnooy Kan,
Leen Stougie,
Carlo Vercellis:
A Probabilistic Analysis of the Multiknapsack Value Function.
Math. Program. 46: 237-247 (1990) |
| 1989 |
|---|
| 4 | | Igal Adiri,
John L. Bruno,
Esther Frostig,
A. H. G. Rinnooy Kan:
Single Machine Flow-Time Scheduling With a Single Breakdown.
Acta Inf. 26(7): 679-696 (1989) |
| 1983 |
|---|
| 3 | | J. T. Postmus,
A. H. G. Rinnooy Kan,
G. T. Timmer:
An Efficient Dynamic Selection Method.
Commun. ACM 26(11): 878-881 (1983) |
| 1982 |
|---|
| 2 | | 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) |
| 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) |
