Evolution and Optimum Seeking

References 275
Graves, R.L., P. Wolfe (Eds.) (1963), Recent advances in mathematical programming,
McGraw-Hill, New York
Greenberg, H. (1971), Integer programming, Academic Press, New York
Greenstadt, J. (1967a), On the relative e ciencies of gradient methods, Math. Comp.
21, 360-367
Greenstadt, J. (1967b), Bestimmung der Eigenwerte einer Matrix nach der Jacobi-
Methode, in: Ralston and Wilf (1967), pp. 152-168
Greenstadt, J. (1970), Variations on variable-metric methods, Math. Comp. 24, 1-22
Greenstadt, J. (1972), A quasi-Newton method with no derivatives, Math. Comp. 26,
145-166
Grefenstette, J.J. (Ed.) (1985), Proceedings of the 1st International Conference on
Genetic Algorithms, Carnegie-Mellon University, Pittsburgh PA, July 24-26, 1985,
Lawrence Erlbaum, Hillsdale NJ
Grefenstette, J.J. (Ed.) (1987), Proceedings of the 2nd International Conference on
Genetic Algorithms, MIT, Cambridge MA, July 28-31, 1987, Lawrence Erlbaum,
Hillsdale NJ
Gritzmann, P., R. Hettich, R. Horst, E. Sachs (Eds.) (1992), Operations Research '91,
Extended Abstracts of the 16th Symposium on Operations Research, Trier, Sept.
9-11, 1991, Physica-Verlag, Heidelberg
Grusser, O.J., R. Klinke (Eds.) (1971), Zeichenerkennung durch biologische und technische
Systeme, Springer, Berlin
Guilfoyle, G., I. Johnson, P. Wheatley (1967), One-dimensional search combining golden
section and cubic t techniques, Analytical Mechanics Associates Inc., quarterly
report 67-1, Westbury, Long Island NY, Jan. 1967
Guin, J.A. (1968), Modi cation of the complex method of constrained optimization,
Comp. J. 10, 416-417
Gurin, L.S. (1966), Random search in the presence of noise, Engng. Cybern. 4(3),
252-260
Gurin, L.S., V.P. Lobac (1963), Combination of the Monte Carlo method with the
method of steepest descents for the solution of certain extremal problems, AIAA J.
1, 2708-2710
Gurin, L.S., L.A. Rastrigin (1965), Convergence of the random search methodinthe
presence of noise, ARC 26, 1505-1511