Experiments with a new selection criterion in a fast interval optimization algorithm
暂无分享,去创建一个
[1] Dietmar Ratz,et al. Automatische Ergebnisverifikation bei globalen Optimierungsproblemen , 1992 .
[2] Eldon Hansen,et al. Global optimization using interval analysis , 1992, Pure and applied mathematics.
[3] Ramon E. Moore,et al. Inclusion functions and global optimization II , 1988, Math. Program..
[4] Aimo A. Törn,et al. Global Optimization , 1999, Science.
[5] Yuji Shinano,et al. Control schemes in a generalized utility for parallel branch-and-bound algorithms , 1997, Proceedings 11th International Parallel Processing Symposium.
[6] T. Csendes,et al. A review of subdivision direction selection in interval methods for global optimization , 1997 .
[7] Ulrich W. Kulisch,et al. C++ Toolbox for Verified Scientific Computing I: Basic Numerical Problems , 1997 .
[8] R. Horst,et al. Global Optimization: Deterministic Approaches , 1992 .
[9] P. Pardalos,et al. Handbook of global optimization , 1995 .
[10] T. Ibaraki. Enumerative approaches to combinatorial optimization - part I , 1988 .
[11] H. Zimmermann. Towards global optimization 2: L.C.W. DIXON and G.P. SZEGÖ (eds.) North-Holland, Amsterdam, 1978, viii + 364 pages, US $ 44.50, Dfl. 100,-. , 1979 .
[12] Inmaculada García,et al. Work load balance approaches for branch and bound algorithms on distributed systems , 1999, Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99.
[13] Jon G. Rokne,et al. New computer methods for global optimization , 1988 .
[14] Tibor Csendes,et al. On the selection of subdivision directions in interval branch-and-bound methods for global optimization , 1995, J. Glob. Optim..
[15] Ulrich W. Kulisch,et al. C++ Toolbox for Verified Computing I: Basic Numerical Problems Theory, Algorithms, and Programs , 1997 .