Alexander H. G. Rinnooy Kan

A. H. G. Rinnooy Kan

	2003
c1		A. H. G. Rinnooy Kan: Managing a multi-billion dollar IT Budget. ICSM 2003: 2-
	1994
j16		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
j15		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)
j14		Olaf E. Flippo, Alexander H. G. Rinnooy Kan: Decomposition in general mathematical programming. Math. Program. 60: 361-382 (1993)
	1991
j13		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
j12		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)
j11		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
j10		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)
	1984
j9		Alberto Marchetti-Spaccamela, A. H. G. Rinnooy Kan, Leen Stougie: Hierarchical vehicle routing problems. Networks 14(4): 571-586 (1984)
	1983
j8		J. T. Postmus, A. H. G. Rinnooy Kan, G. T. Timmer: An Efficient Dynamic Selection Method. Commun. ACM 26(11): 878-881 (1983)
j7		W. 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)
j6		Alexander H. G. Rinnooy Kan: Capacity expansion - analysis of simple models with applications, by John Freidenfels, North Holland, 1981, 291 pp. Price: $39.50. Networks 13(2): 303 (1983)
	1982
j5		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)
	1981
j4		Jan Karel Lenstra, A. H. G. Rinnooy Kan: Complexity of vehicle routing and scheduling problems. Networks 11(2): 221-227 (1981)
	1980
j3		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)
	1978
j2		David S. Johnson, Jan Karel Lenstra, A. H. G. Rinnooy Kan: The complexity of the network design problem. Networks 8(4): 279-285 (1978)
	1976
j1		Jan Karel Lenstra, A. H. G. Rinnooy Kan: On general routing problems. Networks 6(3): 273-280 (1976)

Coauthor Index

Colors in the list of coauthors

Last update Wed May 22 22:15:44 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page