This is a preview of subscription content, log in to check access.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
N. Z. Shor, “Method of interception with stretching of space to solve convex programming problems,” Kibernetika, No. 1, 94–95 (1977).
N. Z. Shor and V. I. Gershovich, “On a family of algorithms to solve convex programming problems,” Kibernetika, No. 4, 62–67 (1979).
N. Z. Shor, Methods of Minimization of Nondifferentiable Functions and Their Application [in Russian], Naukva Dumka, Kiev (1979).
D. B. Yudin and A. S. Nemirovskii, “Informational complexity and effective methods of solving convex extremal problems,” Ekonom. Mat. Metody,12, No. 2, 357–369 (1976).
M. Grötshel, L. Lovász, and A. Shrijver, “The ellipsoid method and its consequences in combinatorial optimization,” Combinatorica,1, No. 2, 169–197 (1981).
C. Grossmann and A. Kaplan, Strafmetoden und Modifizierte Lagrangefunktionen in der Nichtlinearen Optimierung, Teubner Verlagsgesselschaft, Leipzig (1979).
F. Körner and C. Richter, “Zur effectiven Lösung von Booleschen, quadratischen optimierungs Problemen,” Numer. Math.,40, 99–109 (1982).
Translated from Kibernetika, No. 2, pp. 48–50, 54, March–April, 1985.
About this article
Cite this article
Shor, N.Z., Davydov, A.S. Method of obtaining estimates in quadratic extremal problems with Boolean variables. Cybern Syst Anal 21, 207–211 (1985). https://doi.org/10.1007/BF01072102
- Operating System
- Artificial Intelligence
- System Theory
- Extremal Problem
- Boolean Variable