Author:
Grosan Crina,Abraham Ajith,Chis Monica,Chang Tae-Gyu
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Clausen, J., Zilinskas, A.: Subdivision, sampling and initialization strategies for simplical branch and bound in global optimization. Computers and Mathematics with Applications 44, 943–955 (2002)
2. Csallner, A.E.: Lipschitz continuity and the termination of interval methods for global optimization. Computers and Mathematics with Applications 42, 1035–1042 (2001)
3. Floudas, C.A., Pardalos, P.M.: A collection of test problems for constraint global optimization algorithms. Springer, Heidelberg (1990)
4. Grosan, C., Abraham, A.: A simple strategy for nonlinear optimization. In: Proceedings of the Third International Conference on Neural, Parallel and Scientific Computation, Atlanta, USA (in press, 2006)
5. Hedar, A.R., Fukushima, M.: Simplex coding genetic algorithm for the global optimization of nonlinear functions. In: Tanino, T., Tanaka, T., Inuiguchi, M. (eds.) Multi-Objective Programming and Goal Programming, pp. 135–140. Springer, Heidelberg (2003)