Nested Partitions Method for Global Optimization

References

  • Baba N., Shoman T., Sawaragi Y. A modified convergence theorem for a random optimization method. Information Sci. (1977) 13:159–166CrossrefGoogle Scholar
  • Benson H. P., Eranguc S. S., Horst R. A note on adapting methods for continuous global optimization to the discrete case. Ann. Oper. Res. (1990) 25:243–252CrossrefGoogle Scholar
  • Boender C. G. E., Rinnooy Kan H. G. On when to stop sampling for the maximum. J. Global Optim. (1991) 1:331–340CrossrefGoogle Scholar
  • Boender C. G. E., Romeijn H. E., Pardalos Horst. Stochastic methods. Handbook of Global Optimization (1995) (Kluwer Academic Publishers, Norwell, MA) CrossrefGoogle Scholar
  • De Haan L. Estimation of the minimum of a function using order statistics. J. Amer. Statist. Assoc. (1981) 76:467–469CrossrefGoogle Scholar
  • Ho Y. C., Sreenivas R. S., Vakili P. Ordinal optimization of DEDS. Discrete Event Dynamic Systems: Theory and Applications (1992) 2:61–88CrossrefGoogle Scholar
  • Hoel P. G., Port S. C., Stone C. J.Introduction to Stochastic Processes (1972) (Waveland Press, Prospect Heights, IL) Google Scholar
  • Horst R., Tuy H.Global Optimization: Deterministic Approaches (1990) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Horst R., Pardalos P. M.Handbook of Global Optimization (1995) (Kluwer Academic Publishers, Norwell, MA) CrossrefGoogle Scholar
  • Matyas J. Random optimization. Automation and Remote Control (1965) 26:246–253Google Scholar
  • Romeijn H. E., Smith R. L. Simulated annealing for constrained global optimization. J. Global Optim. (1994) 5:101–126CrossrefGoogle Scholar
  • Schoen F. Stochastic techniques for global optimization. J. Global Optim. (1991) 1:207–228CrossrefGoogle Scholar
  • Shi L., Ólafsson S. Nested partitions method for stochastic optimization. (1988) . Technical Report. Department of Industrial Engineering, University of Wisconsin, Madison, WIGoogle Scholar
  • Shi L., Ólafsson S., Sun N. A new parallel randomized algorithms for the traveling salesman problem. Comput. Oper. Res. (1999) 26:371–394CrossrefGoogle Scholar
  • Solis F. J., Wets R. J-B. Minimization by random search techniques. Math. Oper. Res. (1981) 6:19–30LinkGoogle Scholar
  • Tang Z. B. Adaptive partitioned random search to global optimization. IEEE. Trans. Automatic Control (1994) 39:2235–2244CrossrefGoogle Scholar
  • Törn A., Žilinskas A.Global Optimization (1989) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Zabinsky Z. B., Smith R. L. Pure adaptive search in global optimization. Math. Programming (1992) 53:323–338CrossrefGoogle Scholar
  • Zabinsky Z. B., Wood G. R., Steel M. A., Baritompa W. P. Pure adaptive search for finite global optimization. Math. Programming (1995) 69:443–448CrossrefGoogle Scholar
  • Zhigljavsky A. A.Theory of Global Random Search (1991) (Kluwer Academic Publishers, Norwell, MA) CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.