The following pages link to Alexander H. G. Rinnooy Kan (Q689139):
Displayed 50 items.
- Decomposition in general mathematical programming (Q689140) (← links)
- The future of operations research is bright (Q721667) (← links)
- Item:Q689139 (redirect page) (← links)
- New directions in scheduling theory (Q786649) (← links)
- A note on Benders' decomposition in mixed-integer quadratic programming (Q908853) (← links)
- Concurrent stochastic methods for global optimization (Q908855) (← links)
- A probabilistic analysis of the multiknapsack value function (Q909581) (← links)
- On the relation between complexity and uncertainty (Q920029) (← links)
- Scheduling subject to resource constraints: Classification and complexity (Q1052820) (← links)
- An introduction to the analysis of approximation algorithms (Q1076513) (← links)
- A probabilistic analysis of the next fit decreasing bin packing heuristic (Q1085074) (← links)
- The rate of convergence to optimality of the LPT rule (Q1087469) (← links)
- Order statistics and the linear assignment problem (Q1098186) (← links)
- A random field model for estimating the content of soil layers (Q1101770) (← links)
- Single machine flow-time scheduling with a single breakdown (Q1111018) (← links)
- A simulation tool for the performance evaluation of parallel branch and bound algorithms (Q1111941) (← links)
- Complexity results for scheduling chains on a single machine (Q1142687) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- The stochastic vehicle routing problem revisited (Q1197946) (← links)
- On when to stop sampling for the maximum (Q1200523) (← links)
- Branching from the largest upper bound. Folklore and facts (Q1247917) (← links)
- A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer (Q1253610) (← links)
- Machine allocation problems in manufacturing networks (Q1262201) (← links)
- Sensitivity analysis of list scheduling heuristics (Q1339396) (← links)
- A class of generalized greedy algorithms for the multi-knapsack problem (Q1803680) (← links)
- The asymptotic behaviour of a distributive sorting method (Q1838309) (← links)
- Additively separable duality theory (Q1908637) (← links)
- (Q2988069) (← links)
- Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740) (← links)
- Bayesian stopping rules for multistart global optimization methods (Q3030595) (← links)
- A stochastic method for global optimization (Q3039049) (← links)
- (Q3202142) (← links)
- (Q3206648) (← links)
- (Q3206662) (← links)
- (Q3206954) (← links)
- (Q3208408) (← links)
- (Q3217918) (← links)
- (Q3217922) (← links)
- Stochastic Methods for Global Optimization (Q3220103) (← links)
- (Q3221735) (← links)
- (Q3354454) (← links)
- Probabilistic analysis of algorithms for dual bin packing problems (Q3361889) (← links)
- A Bayesian Approach to Simulated Annealing (Q3415945) (← links)
- (Q3470253) (← links)
- The Optimal Selection of Small Portfolios (Q3657720) (← links)
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem (Q3674391) (← links)
- STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING (Q3678972) (← links)
- (Q3688111) (← links)
- Asymptotic Properties of the Quadratic Assignment Problem (Q3696855) (← links)