Evolution and Optimum Seeking

References 317
Wald, A. (1966), Sequential analysis, 8th ed., Wiley, NewYork
Wallack, P. (1964), Certi cation of algorithm 203 (E4)|steep 1, CACM 7, 585
Walsh, J. (Ed.) (1966), Numerical analysis|an introduction, Academic Press, London
Ward, L., A. Nag, L.C.W. Dixon (1969), Hill-climbing techniques as a method of calculating
the optical constants and thickness of a thin metallic lm, Brit. J. Appl.
Phys. (J. Phys. D), Ser. 2, 2, 301-304
Wasan, M.T. (1969), Stochastic approximation, Cambridge University Press, Cambridge
UK
Wasscher, E.J. (1963a), Algorithm 203 (E4)|steep 1, CACM 6, 517-519
Wasscher, E.J. (1963b), Algorithm 204 (E4)|steep 2, CACM 6, 519
Wasscher, E.J. (1963c), Remark on algorithm 129 (E4)|minifun, CACM 6, 521
Wasscher, E.J. (1965), Remark on algorithm 205 (E4)|ative, CACM 8, 171
Weber, H.H. (1972), Einfuhrung in Operations Research, Akademische Verlagsgesellschaft,
Frankfort/Main
Wegge, L. (1966), On a discrete version of the Newton-Raphson method, SIAM J. Numer.
Anal. 3, 134-142
Weinberg, F. (Ed.) (1968), Einfuhrung in die Methode Branch and Bound, Springer,
Berlin
Weinberg, F., C.A. Zehnder (Eds.) (1969), Heuristische Planungsmethoden, Springer,
Berlin
Weisman, J., C.F. Wood (1966), The use of optimal search for engineering design, in:
Lavi and Vogl (1966), pp. 219-228
Weisman, J., C.F. Wood, L. Rivlin (1965), Optimal design of chemical process systems,
AIChE Engineering Progress Symposium Series 61, no. 55, pp. 50-63
Weiss, E.A., D.H. Archer, D.A. Burt (1961), Computer sets tower for best run, Petrol
Re ner 40(10), 169-174
Wells, M. (1965), Algorithm 251 (E4)|function minimization (Flepomin), CACM 8,
169-170
Werner, J. (1974), Uber die Konvergenz des Davidon-Fletcher-Powell-Verfahrens fur
streng konvexe Minimierungsaufgaben im Hilbert-Raum, Computing 12, 167-176
Wheeling, R.F. (1960), Optimizers|their structure, CACM 3, 632-638