A. H. G. Rinnooy Kan

39 papers Journal 38Unranked 1

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