Alexander H. G. Rinnooy Kan

发表

The asymptotic behaviour of a distributive sorting method

W. B. van Dam, J. B. G. Frenk, Alexander H. G. Rinnooy Kan, 2005, Computing.

A framework for the probabilistic analysis of hierarchical planning systems

Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, Leen Stougie, 1984, Ann. Oper. Res..

Probabilistic Analysis of Algorithms for Dual Bin Packing Problems

J. B. G. Frenk, Alexander H. G. Rinnooy Kan, János Csirik, 1991, J. Algorithms.

Machine allocation algorithms for job shop manufacturing

Alexander H. G. Rinnooy Kan, Mario van Vliet, A. Kan, 1991, J. Intell. Manuf..

Decomposition in general mathematical programming

Alexander H. G. Rinnooy Kan, Olaf E. Flippo, O. E. Flippo, 1993, Math. Program..

Scheduling subject to resource constraints: classification and complexity

Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, Jacek Blazewicz, 1983, Discret. Appl. Math..

Bounds and Heuristics for Capacitated Routing Problems

Alexander H. G. Rinnooy Kan, Mordecai Haimovich, A. Kan, 1985, Math. Oper. Res..

Preface

Alexander H. G. Rinnooy Kan, 1985, Discret. Appl. Math..

Analytical Evaluation of Hierarchical Planning Systems

B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1981, Oper. Res..

An efficient dynamic selection method

Alexander H. G. Rinnooy Kan, J. T. Postmus, G. T. Timmer, 1983, CACM.

An introduction to the analysis of approximation algorithms

Alexander H. G. Rinnooy Kan, A. Kan, 1986, Discret. Appl. Math..

Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1980, SIAM J. Comput..

A General Bounding Scheme for the Permutation Flow-Shop Problem

B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1978, Oper. Res..

Average Case Analysis of a Heuristic for the Assignment Problem

Alexander H. G. Rinnooy Kan, Richard M. Karp, Rakesh V. Vohra, 1994, Math. Oper. Res..

Optimality as a prescriptive tool

Alexander H. G. Rinnooy Kan, A. Kan, 1991, Behavioral and Brain Sciences.

Surrogate duality relaxation for job shop scheduling

B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1983, Discret. Appl. Math..

Hierarchical vehicle routing problems

Alexander H. G. Rinnooy Kan, Leen Stougie, Alberto Marchetti-Spaccamela, 1984, Networks.

Formulation and a Lagrangean Relaxation Procedure for Solving Part Scheduling and Tool Loading Problems in FMS

Alexander H. G. Rinnooy Kan, Marshall L. Fisher, Kannan Sethuraman, 1992 .

Order statistics and the linear assignment problem

J. B. G. Frenk, Alexander H. G. Rinnooy Kan, M. van Houweninge, 2015, Computing.

Preface : Current developments in the interface economics, econometrics, mathematics

Alexander H. G. Rinnooy Kan, Michiel Hazewinkel, M. Hazewinkel, 1982 .

Minimizing Maximum Lateness in a Two-Machine Open Shop

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1979, Math. Oper. Res..

Vehicle Routing with Time Windows

Alexander H. G. Rinnooy Kan, Antoon W. J. Kolen, Harry W. J. M. Trienekens, 1987, Oper. Res..

A hierarchical scheduling problem with a well-solvable second stage

J. B. G. Frenk, Alexander H. G. Rinnooy Kan, Leen Stougie, 1984, Ann. Oper. Res..

On general routing problems

Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, J. Lenstra, 1976, Networks.

Single machine flow-time scheduling with a single breakdown

Alexander H. G. Rinnooy Kan, John L. Bruno, Esther Frostig, 1989, Acta Informatica.

Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra

Robert L. Smith, Alexander H. G. Rinnooy Kan, Jan Telgen, 1991, Oper. Res..

A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem

Alexander H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis, 1993, Discret. Appl. Math..

The Asymptotic Optimality of the LPT Rule

J. B. G. Frenk, Alexander H. G. Rinnooy Kan, A. Kan, 1987, Math. Oper. Res..

The future of operations research is bright

Alexander H. G. Rinnooy Kan, 1989 .

Interactive Optimization of Bulk Sugar Deliveries

Alexander H. G. Rinnooy Kan, André van Vliet, C. Guus E. Boender, 1992 .

Bayesian stopping rules for multistart global optimization methods

Alexander H. G. Rinnooy Kan, C. G. E. Boender, A. Kan, 1987, Math. Program..

Preface

Alexander H. G. Rinnooy Kan, Stephen C. Graves, Paul Herbert Zipkin, 1993, Logistics of Production and Inventory.

Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems

B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1983, Math. Oper. Res..

Boundary stresses in the thread joints of glazed compressor tubing during making up with elastic tension

Alexander H. G. Rinnooy Kan, B. N. Dudko, E. E. Bochenov, 1974 .

The rate of convergence to optimality of the LPT rule

J. B. G. Frenk, Alexander H. G. Rinnooy Kan, A. Kan, 1986, Discret. Appl. Math..

Complexity of Scheduling under Precedence Constraints

Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, J. Lenstra, 1978, Oper. Res..

The Design, Analysis and Implementation of Heuristics

Alexander H. G. Rinnooy Kan, Marshall L. Fisher, 1988 .

Chapter 9 Sequencing and scheduling: Algorithms and complexity

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1993, Logistics of Production and Inventory.

Technical Note - On Mitten's Axioms for Branch-and-Bound

Alexander H. G. Rinnooy Kan, 1976, Oper. Res..

Sensitivity Analysis of List Scheduling Heuristics

Albert P. M. Wagelmans, Alexander H. G. Rinnooy Kan, Stan P. M. van Hoesel, 1994, Discret. Appl. Math..

A probabilistic analysis of the multiknapsack value function

Alexander H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis, 2015, Math. Program..

Capacity expansion - analysis of simple models with applications, by John Freidenfels, North Holland, 1981, 291 pp. Price: $39.50

Alexander H. G. Rinnooy Kan, 1983, Networks.

Scheduling theory since 1981: an annotated bibliography

Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, J. Lenstra, 1983 .

A simulation tool for the performance evaluation of parallel branch and bound algorithms

Alexander H. G. Rinnooy Kan, Arie de Bruin, Harry W. J. M. Trienekens, 1988, Math. Program..

On when to stop sampling for the maximum

Alexander H. G. Rinnooy Kan, C. G. E. Boender, A. Kan, 1991, J. Glob. Optim..

Computer-Aided complexity classification of combinational problems

B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1982, CACM.

Managing a multi-billion dollar IT budget

Alexander H. G. Rinnooy Kan, 2003, International Conference on Software Maintenance, 2003. ICSM 2003. Proceedings..

Asymptotic Properties of the Quadratic Assignment Problem

Alexander H. G. Rinnooy Kan, M. van Houweninge, J. B. G. Frenk, 1985, Math. Oper. Res..

Stochastic methods for global optimization

Alexander H. G. Rinnooy Kan, G. Th. Timmer, A. Kan, 1984 .

Traveling Salesman Problem

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 2016 .

A stochastic method for global optimization

Alexander H. G. Rinnooy Kan, Leen Stougie, C. G. E. Boender, 1982, Math. Program..

Hit-and-run algorithms for the identification of nonredundant linear inequalities

Robert L. Smith, Alexander H. G. Rinnooy Kan, Jan Telgen, 1987, Math. Program..

Concurrent stochastic methods for global optimization

Alexander H. G. Rinnooy Kan, Richard H. Byrd, Bobby Schnabel, 1990, Math. Program..

A Guided Tour of Combinatorial Optimization

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1985 .

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

Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1978, Oper. Res..

Scheduling subject to nonrenewable-resource constraints

Alexander H. G. Rinnooy Kan, J. Carlier, A. Kan, 1982, Oper. Res. Lett..

Minimizing Total Costs in One-Machine Scheduling

B. J. Lageweg, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1975, Oper. Res..

A note on benders decomposition in mixed-integer quadratic programming

Alexander H. G. Rinnooy Kan, Olaf E. Flippo, 1990 .