dblp.uni-trier.dewww.uni-trier.de

Alexander H. G. Rinnooy Kan Vis

A. H. G. Rinnooy Kan

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2003
12EEA. H. G. Rinnooy Kan: Managing a multi-billion dollar IT Budget. ICSM 2003: 2-
1994
11EEAntoon 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
10EEA. 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)
9 Olaf E. Flippo, Alexander H. G. Rinnooy Kan: Decomposition in general mathematical programming. Math. Program. 60: 361-382 (1993)
1991
8 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
7 Richard H. Byrd, Cornelius L. Dert, Alexander H. G. Rinnooy Kan, Robert B. Schnabel: Concurrent Stochastic Methods for Global Optimization. Math. Program. 46: 1-29 (1990)
6 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
5 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
4 J. T. Postmus, A. H. G. Rinnooy Kan, G. T. Timmer: An Efficient Dynamic Selection Method. Commun. ACM 26(11): 878-881 (1983)
3EEW. B. Dam, J. B. G. Frenk, Alexander H. G. Rinnooy Kan: The asymptotic behaviour of a distributive sorting method. Computing 31(4): 287-303 (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)

Coauthor Index

1Igal Adiri [5]
2John L. Bruno [5]
3Richard H. Byrd [7]
4János Csirik [8]
5W. B. Dam [3]
6Cornelius L. Dert [7]
7Olaf E. Flippo [9]
8J. B. G. Frenk [3] [8]
9Esther Frostig [5]
10Gábor Galambos [8]
11Stan P. M. van Hoesel (C. P. M. van Hoesel) [11]
12Antoon W. J. Kolen [11]
13B. J. Lageweg [2]
14Eugene L. Lawler [1]
15Jan Karel Lenstra [1] [2]
16M. Meanti [6]
17J. T. Postmus [4]
18Robert B. Schnabel [7]
19Leen Stougie [6] [10]
20G. T. Timmer [4]
21Carlo Vercellis [6] [10]
22Albert P. M. Wagelmans [11]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)