Alexander H. G. Rinnooy Kan

According to our database1, Alexander H. G. Rinnooy Kan authored at least 52 papers between 1975 and 2003.

Collaborative distances:



In proceedings 
PhD thesis 




Managing a multi-billion dollar IT Budget.
Proceedings of the 19th International Conference on Software Maintenance (ICSM 2003), 2003

Average Case Analysis of a Heuristic for the Assignment Problem.
Math. Oper. Res., 1994

Sensitivity Analysis of List Scheduling Heuristics.
Discrete Applied Mathematics, 1994

Probabilistic Analysis of Packing and Partitioning Algorithms (E. G. Coffman, Jr. and George S. Lueker).
SIAM Review, 1993

Decomposition in general mathematical programming.
Math. Program., 1993

A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem.
Discrete Applied Mathematics, 1993

Machine allocation algorithms for job shop manufacturing.
J. Intelligent Manufacturing, 1991

On when to stop sampling for the maximum.
J. Global Optimization, 1991

Probabilistic Analysis of Algorithms for Dual Bin Packing Problems.
J. Algorithms, 1991

Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra.
Operations Research, 1991

A Probabilistic Analysis of the Multiknapsack Value Function.
Math. Program., 1990

Concurrent Stochastic Methods for Global Optimization.
Math. Program., 1990

OR Forum - Perspectives on Parallel Computing.
Operations Research, 1989

Single Machine Flow-Time Scheduling With a Single Breakdown.
Acta Inf., 1989

A simulation tool for the performance evaluation of parallel branch and bound algorithms.
Math. Program., 1988

Stochastic global optimization methods part II: Multi level methods.
Math. Program., 1987

Stochastic global optimization methods part I: Clustering methods.
Math. Program., 1987

Bayesian stopping rules for multistart global optimization methods.
Math. Program., 1987

Hit-and-run algorithms for the identification of nonredundant linear inequalities.
Math. Program., 1987

The Asymptotic Optimality of the LPT Rule.
Math. Oper. Res., 1987

Vehicle Routing with Time Windows.
Operations Research, 1987

Order statistics and the linear assignment problem.
Computing, 1987

An introduction to the analysis of approximation algorithms.
Discrete Applied Mathematics, 1986

The rate of convergence to optimality of the LPT rule.
Discrete Applied Mathematics, 1986

Bounds and Heuristics for Capacitated Routing Problems.
Math. Oper. Res., 1985

Asymptotic Properties of the Quadratic Assignment Problem.
Math. Oper. Res., 1985

Discrete Applied Mathematics, 1985

Hierarchical vehicle routing problems.
Networks, 1984

A framework for the probabilistic analysis of hierarchical planning systems.
Annals OR, 1984

A hierarchical scheduling problem with a well-solvable second stage.
Annals OR, 1984

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

Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems.
Math. Oper. Res., 1983

Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints.
Operations Research, 1983

Surrogate duality relaxation for job shop scheduling.
Discrete Applied Mathematics, 1983

Scheduling subject to resource constraints: classification and complexity.
Discrete Applied Mathematics, 1983

The asymptotic behaviour of a distributive sorting method.
Computing, 1983

An Efficient Dynamic Selection Method.
Commun. ACM, 1983

Scheduling subject to nonrenewable-resource constraints.
Oper. Res. Lett., 1982

A stochastic method for global optimization.
Math. Program., 1982

Math. Oper. Res., 1982

Computer-Aided Complexity Classification of Combinatorial Problems.
Commun. ACM, 1982

Complexity of vehicle routing and scheduling problems.
Networks, 1981

Minimizing Maximum Lateness in a Two-Machine Open Shop.
Math. Oper. Res., 1981

Analytical Evaluation of Hierarchical Planning Systems.
Operations Research, 1981

Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms.
SIAM J. Comput., 1980

The complexity of the network design problem.
Networks, 1978

Technical Note - On the Expected Performance of Branch-and-Bound Algorithms.
Operations Research, 1978

Complexity of Scheduling under Precedence Constraints.
Operations Research, 1978

A General Bounding Scheme for the Permutation Flow-Shop Problem.
Operations Research, 1978

On general routing problems.
Networks, 1976

Technical Note - On Mitten's Axioms for Branch-and-Bound.
Operations Research, 1976

Minimizing Total Costs in One-Machine Scheduling.
Operations Research, 1975