default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander H. G. Rinnooy Kan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[c1]A. H. G. Rinnooy Kan:
Managing a multi-billion dollar IT Budget. ICSM 2003: 2-
1990 – 1999
- 1994
- [j51]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): 145-162 (1994) - [j50]Richard M. Karp, Alexander H. G. Rinnooy Kan, Rakesh V. Vohra:
Average Case Analysis of a Heuristic for the Assignment Problem. Math. Oper. Res. 19(3): 513-522 (1994) - 1993
- [j49]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): 279-290 (1993) - [j48]Olaf E. Flippo, Alexander H. G. Rinnooy Kan:
Decomposition in general mathematical programming. Math. Program. 60: 361-382 (1993) - [j47]Alexander H. G. Rinnooy Kan, A. van Vliet:
Probabilistic Analysis of Packing and Partitioning Algorithms (E. G. Coffman, Jr. and George S. Lueker). SIAM Rev. 35(1): 153-154 (1993) - [p2]Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys:
Chapter 9 Sequencing and scheduling: Algorithms and complexity. Logistics of Production and Inventory 1993: 445-522 - [p1]Stephen C. Graves, Alexander H. G. Rinnooy Kan, Paul Herbert Zipkin:
Preface. Logistics of Production and Inventory 1993: v-vii - [e1]Stephen C. Graves, Alexander H. G. Rinnooy Kan, Paul Herbert Zipkin:
Logistics of Production and Inventory. Handbooks in Operations Research and Management Science 4, North-Holland 1993, ISBN 978-0-444-87472-6 [contents] - 1991
- [j46]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): 945-954 (1991) - [j45]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) - [j44]C. G. E. Boender, A. H. G. Rinnooy Kan:
On when to stop sampling for the maximum. J. Glob. Optim. 1(4): 331-340 (1991) - [j43]Mario van Vliet, Alexander H. G. Rinnooy Kan:
Machine allocation algorithms for job shop manufacturing. J. Intell. Manuf. 2(2): 83-94 (1991) - 1990
- [j42]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) - [j41]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)
1980 – 1989
- 1989
- [j40]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): 679-696 (1989) - [j39]Gerard A. P. Kindervater, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
OR Forum - Perspectives on Parallel Computing. Oper. Res. 37(6): 985-990 (1989) - 1988
- [j38]Arie de Bruin, Alexander H. G. Rinnooy Kan, Harry W. J. M. Trienekens:
A simulation tool for the performance evaluation of parallel branch and bound algorithms. Math. Program. 42(1-3): 245-271 (1988) - 1987
- [j37]J. B. G. Frenk, M. van Houweninge, Alexander H. G. Rinnooy Kan:
Order statistics and the linear assignment problem. Computing 39(2): 165-174 (1987) - [j36]Antoon W. J. Kolen, A. H. G. Rinnooy Kan, Harry W. J. M. Trienekens:
Vehicle Routing with Time Windows. Oper. Res. 35(2): 266-273 (1987) - [j35]J. B. G. Frenk, A. H. G. Rinnooy Kan:
The Asymptotic Optimality of the LPT Rule. Math. Oper. Res. 12(2): 241-254 (1987) - [j34]C. G. E. Boender, A. H. G. Rinnooy Kan:
Bayesian stopping rules for multistart global optimization methods. Math. Program. 37(1): 59-80 (1987) - [j33]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): 184-207 (1987) - [j32]Alexander H. G. Rinnooy Kan, G. T. Timmer:
Stochastic global optimization methods part I: Clustering methods. Math. Program. 39(1): 27-56 (1987) - [j31]Alexander H. G. Rinnooy Kan, G. T. Timmer:
Stochastic global optimization methods part II: Multi level methods. Math. Program. 39(1): 57-78 (1987) - 1986
- [j30]A. H. G. Rinnooy Kan:
An introduction to the analysis of approximation algorithms. Discret. Appl. Math. 14(2): 171-185 (1986) - [j29]J. B. G. Frenk, A. H. G. Rinnooy Kan:
The rate of convergence to optimality of the LPT rule. Discret. Appl. Math. 14(2): 187-197 (1986) - 1985
- [j28]A. H. G. Rinnooy Kan:
Preface. Discret. Appl. Math. 10(2): 115 (1985) - [j27]J. B. G. Frenk, M. van Houweninge, A. H. G. Rinnooy Kan:
Asymptotic Properties of the Quadratic Assignment Problem. Math. Oper. Res. 10(1): 100-116 (1985) - [j26]Mordecai Haimovich, Alexander H. G. Rinnooy Kan:
Bounds and Heuristics for Capacitated Routing Problems. Math. Oper. Res. 10(4): 527-542 (1985) - 1984
- [j25]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): 23-42 (1984) - [j24]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): 43-58 (1984) - [j23]Alberto Marchetti-Spaccamela, A. H. G. Rinnooy Kan, Leen Stougie:
Hierarchical vehicle routing problems. Networks 14(4): 571-586 (1984) - 1983
- [j22]J. T. Postmus, A. H. G. Rinnooy Kan, G. T. Timmer:
An Efficient Dynamic Selection Method. Commun. ACM 26(11): 878-881 (1983) - [j21]W. B. van Dam, J. B. G. Frenk, Alexander H. G. Rinnooy Kan:
The asymptotic behaviour of a distributive sorting method. Computing 31(4): 287-303 (1983) - [j20]Jacek Blazewicz, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5(1): 11-24 (1983) - [j19]Marshall L. Fisher, B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan:
Surrogate duality relaxation for job shop scheduling. Discret. Appl. Math. 5(1): 65-75 (1983) - [j18]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): 381-386 (1983) - [j17]M. A. H. Dempster, Marshall 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): 525-537 (1983) - [j16]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
- [j15]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) - [j14]Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Erratum. Math. Oper. Res. 7(4): 635 (1982) - [j13]C. G. E. Boender, A. H. G. Rinnooy Kan, G. T. Timmer, Leen Stougie:
A stochastic method for global optimization. Math. Program. 22(1): 125-140 (1982) - [j12]J. Carlier, A. H. G. Rinnooy Kan:
Scheduling subject to nonrenewable-resource constraints. Oper. Res. Lett. 1(2): 52-55 (1982) - 1981
- [j11]Michael A. H. Dempster, Marshall 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): 707-716 (1981) - [j10]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): 153-158 (1981) - [j9]Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Complexity of vehicle routing and scheduling problems. Networks 11(2): 221-227 (1981) - 1980
- [j8]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)
1970 – 1979
- 1978
- [j7]Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Complexity of Scheduling under Precedence Constraints. Oper. Res. 26(1): 22-35 (1978) - [j6]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): 53-67 (1978) - [j5]Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Technical Note - On the Expected Performance of Branch-and-Bound Algorithms. Oper. Res. 26(2): 347-349 (1978) - [j4]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
- [j3]A. H. G. Rinnooy Kan:
Technical Note - On Mitten's Axioms for Branch-and-Bound. Oper. Res. 24(6): 1176-1178 (1976) - [j2]Jan Karel Lenstra, A. H. G. Rinnooy Kan:
On general routing problems. Networks 6(3): 273-280 (1976) - 1975
- [j1]A. H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra:
Minimizing Total Costs in One-Machine Scheduling. Oper. Res. 23(5): 908-927 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
