This is a preview of subscription content, log in via an institution to check access.
Literature Cited
L. A. Rastrigin, “Random search—problems, methods, and prospects,” in: Problems of Cybernetics, Random Search Problems [in Russian], Izd. Akad. Nauk SSSR, Moscow (1973), pp. 3–17.
L. A. Rastrigin, “Random search—specific features, stages of development, and prejudices,” in: Problems of Cybernetics, Random Search Problems [in Russian], Izd. Akad. Nauk SSSR, Moscow (1978), pp. 3–17.
A. Wald, “Statistical decision functions,” in: Position Games [Russian translation], Nauka, Moscow (1967), pp. 300–522.
V. G. Ustyuzhaninov, “Potential possibilities of random search algorithms,” Avtom. Vychisl. Tekh., No. 1, 71–72 (1980).
V. G. Ustyuzhaninov, “Existence and effectiveness of optimal random search algorithms,” Probl. Sluchain. Poiska, No. 9, 9–29 (1981).
V. G. Ustyuzhaninov, “Random search for optimal system of features,” Vychisl. Sistemy, No. 77, 42–53 (1978).
D. B. Yudin and A. S. Nemirovskii, “Effectiveness of random search in control problems,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 3, 3–18 (1977).
V. K. Leont'ev, “Upper bound for α-depth of matrices,” Mat. Zametki,15, No. 3, 421–431 (1974).
Additional information
Translated from Kibernetika, No. 2, pp. 64–71, 77, March–April, 1983.
Rights and permissions
About this article
Cite this article
Ustyuzhaninov, V.G. Use of random search in solving discrete extremal problems. Cybern Syst Anal 19, 227–238 (1983). https://doi.org/10.1007/BF01072025
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01072025