Author of the publication

Technical Note - On the Expected Performance of Branch-and-Bound Algorithms.

, and . Operations Research, 26 (2): 347-349 (1978)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem., , and . Discret. Appl. Math., 42 (2): 279-290 (1993)Managing a multi-billion dollar IT Budget.. ICSM, page 2-. IEEE Computer Society, (2003)Technical Note - On the Expected Performance of Branch-and-Bound Algorithms., and . Operations Research, 26 (2): 347-349 (1978)A General Bounding Scheme for the Permutation Flow-Shop Problem., , and . Operations Research, 26 (1): 53-67 (1978)Complexity of Vehicle Routing Problem with Time Windows, and . Networks, (1981)Vehicle Routing with Time Windows., , and . Operations Research, 35 (2): 266-273 (1987)Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms., , and . SIAM J. Comput., 9 (3): 558-565 (1980)Scheduling subject to resource constraints: classification and complexity., , and . Discret. Appl. Math., 5 (1): 11-24 (1983)A framework for the probabilistic analysis of hierarchical planning systems., , and . Ann. Oper. Res., 1 (1): 23-42 (1984)IT Governance and Corporate Governance at ING. Information Systems Control Journal, (2004)Author's Note: This article is based upon the transcript of the keynote presentation given by Dr. Alexander Rinnooy Kan at the ISACA EuroCACS Conference, Amsterdam, 24 March 2003. Assistance from John Spangenberg and Paul Williams of ING Corporate IT in the preparation of this article is gratefully acknowledged. A.H.G. Rinnooy Kan is a member of the executive board of Amsterdam-based ING Group, where, amongst other responsibilities, he has direct responsibility for information technology..