A. H. G. Rinnooy Kan

Publication Activity (10 Years)

Years Active: 1975-2003
Publications (10 Years): 0

Publications

A. H. G. Rinnooy Kan
Managing a multi-billion dollar IT Budget. ICSM (2003)
Antoon W. J. Kolen, A. H. G. Rinnooy Kan, C. P. M. van Hoesel, Albert P. M. Wagelmans
Sensitivity Analysis of List Scheduling Heuristics. Discret. Appl. Math. 55 (2) (1994)
A. H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis
A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem. Discret. Appl. Math. 42 (2) (1993)
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) (1991)
C. G. E. Boender, Richard J. Caron, J. Fred McDonald, A. H. G. Rinnooy Kan, H. Edwin Romeijn, Robert L. Smith, Jan Telgen, A. C. F. Vorst
Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra. Oper. Res. 39 (6) (1991)
C. G. E. Boender, A. H. G. Rinnooy Kan
On when to stop sampling for the maximum. J. Glob. Optim. 1 (4) (1991)
M. Meanti, A. H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis
A Probabilistic Analysis of the Multiknapsack Value Function. Math. Program. 46 (1990)
Igal Adiri, John L. Bruno, Esther Frostig, A. H. G. Rinnooy Kan
Single Machine Flow-Time Scheduling With a Single Breakdown. Acta Informatica 26 (7) (1989)
Gerard A. P. Kindervater, Jan Karel Lenstra, A. H. G. Rinnooy Kan
OR Forum - Perspectives on Parallel Computing. Oper. Res. 37 (6) (1989)
Antoon W. J. Kolen, A. H. G. Rinnooy Kan, Harry W. J. M. Trienekens
Vehicle Routing with Time Windows. Oper. Res. 35 (2) (1987)
H. C. P. Berbee, C. G. E. Boender, A. H. G. Rinnooy Kan, C. L. Scheffer, Robert L. Smith, Jan Telgen
Hit-and-run algorithms for the identification of nonredundant linear inequalities. Math. Program. 37 (2) (1987)
J. B. G. Frenk, A. H. G. Rinnooy Kan
The Asymptotic Optimality of the LPT Rule. Math. Oper. Res. 12 (2) (1987)
C. G. E. Boender, A. H. G. Rinnooy Kan
Bayesian stopping rules for multistart global optimization methods. Math. Program. 37 (1) (1987)
A. H. G. Rinnooy Kan
An introduction to the analysis of approximation algorithms. Discret. Appl. Math. 14 (2) (1986)
J. B. G. Frenk, A. H. G. Rinnooy Kan
The rate of convergence to optimality of the LPT rule. Discret. Appl. Math. 14 (2) (1986)
J. B. G. Frenk, M. van Houweninge, A. H. G. Rinnooy Kan
Asymptotic Properties of the Quadratic Assignment Problem. Math. Oper. Res. 10 (1) (1985)
A. H. G. Rinnooy Kan
Preface. Discret. Appl. Math. 10 (2) (1985)
Jan Karel Lenstra, A. H. G. Rinnooy Kan, Leen Stougie
A framework for the probabilistic analysis of hierarchical planning systems. Ann. Oper. Res. 1 (1) (1984)
J. B. G. Frenk, A. H. G. Rinnooy Kan, Leen Stougie
A hierarchical scheduling problem with a well-solvable second stage. Ann. Oper. Res. 1 (1) (1984)
Alberto Marchetti-Spaccamela, A. H. G. Rinnooy Kan, Leen Stougie
Hierarchical vehicle routing problems. Networks 14 (4) (1984)
K. R. Baker, Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints. Oper. Res. 31 (2) (1983)
M. A. H. Dempster, M. L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems. Math. Oper. Res. 8 (4) (1983)
J. T. Postmus, A. H. G. Rinnooy Kan, G. T. Timmer
An Efficient Dynamic Selection Method. Commun. ACM 26 (11) (1983)
Jacek Blazewicz, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5 (1) (1983)
C. G. E. Boender, A. H. G. Rinnooy Kan, G. T. Timmer, Leen Stougie
A stochastic method for global optimization. Math. Program. 22 (1) (1982)
B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Computer-Aided Complexity Classification of Combinatorial Problems. Commun. ACM 25 (11) (1982)
Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Erratum. Math. Oper. Res. 7 (4) (1982)
J. Carlier, A. H. G. Rinnooy Kan
Scheduling subject to nonrenewable-resource constraints. Oper. Res. Lett. 1 (2) (1982)
Jan Karel Lenstra, A. H. G. Rinnooy Kan
Complexity of vehicle routing and scheduling problems. Networks 11 (2) (1981)
Michael A. H. Dempster, M. L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Analytical Evaluation of Hierarchical Planning Systems. Oper. Res. 29 (4) (1981)
Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Minimizing Maximum Lateness in a Two-Machine Open Shop. Math. Oper. Res. 6 (1) (1981)
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) (1980)
Jan Karel Lenstra, A. H. G. Rinnooy Kan
Technical Note - On the Expected Performance of Branch-and-Bound Algorithms. Oper. Res. 26 (2) (1978)
B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
A General Bounding Scheme for the Permutation Flow-Shop Problem. Oper. Res. 26 (1) (1978)
Jan Karel Lenstra, A. H. G. Rinnooy Kan
Complexity of Scheduling under Precedence Constraints. Oper. Res. 26 (1) (1978)
David S. Johnson, Jan Karel Lenstra, A. H. G. Rinnooy Kan
The complexity of the network design problem. Networks 8 (4) (1978)
A. H. G. Rinnooy Kan
Technical Note - On Mitten's Axioms for Branch-and-Bound. Oper. Res. 24 (6) (1976)
Jan Karel Lenstra, A. H. G. Rinnooy Kan
On general routing problems. Networks 6 (3) (1976)
A. H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra
Minimizing Total Costs in One-Machine Scheduling. Oper. Res. 23 (5) (1975)