Skip to main content

and
  1. No Access

    Article

    A probabilistic analysis of the multiknapsack value function

    The optimal solution value of the multiknapsack problem as a function of the knapsack capacities is studied under the assumption that the profit and weight coefficients are generated by an appropriate random m...

    M. Meanti, A. H. G. Rinnooy Kan, L. Stougie, C. Vercellis in Mathematical Programming (1990)

  2. No Access

    Article

    Stochastic global optimization methods part I: Clustering methods

    In this stochastic approach to global optimization, clustering techniques are applied to identify local minima of a real valued objective function that are potentially global. Three different methods of this t...

    A. H. G. Rinnooy Kan, G. T. Timmer in Mathematical Programming (1987)

  3. No Access

    Article

    Stochastic global optimization methods part II: Multi level methods

    In Part II of our paper, two stochastic methods for global optimization are described that, with probability 1, find all relevant local minima of the objective function with the smallest possible number of loc...

    A. H. G. Rinnooy Kan, G. T. Timmer in Mathematical Programming (1987)

  4. No Access

    Article

    Bayesian stop** rules for multistart global optimization methods

    By far the most efficient methods for global optimization are based on starting a local optimization routine from an appropriate subset of uniformly distributed starting points. As the number of local optima i...

    C. G. E. Boender, A. H. G. Rinnooy Kan in Mathematical Programming (1987)

  5. Book Series

  6. No Access

    Book

  7. No Access

    Book

  8. No Access

    Book

  9. No Access

    Book

  10. No Access

    Book

  11. No Access

    Book

  12. No Access

    Book

  13. No Access

    Book

  14. No Access

    Book

  15. No Access

    Book

  16. No Access

    Book

  17. No Access

    Article

    A stochastic method for global optimization

    A stochastic method for global optimization is described and evaluated. The method involves a combination of sampling, clustering and local search, and terminates with a range of confidence intervals on the va...

    C. G. E. Boender, A. H. G. Rinnooy Kan, G. T. Timmer in Mathematical Programming (1982)