RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper., Ser. 2,
2000
Volume 7,
Issue 2,
Pages
74–88
(Mi da303)
This article is cited in
2
papers
The branch-and-bound method for the problem of minimizing a nonconvex quadratic function under convex quadratic constraints
M. S. Nechayeva
,
O. V. Khamisov
L. A. Melentiev Energy Systems Institute, Siberian Branch of the Russian Academy of Sciences
UDC:
519.853.4
Received:
26.06.2000
Fulltext:
PDF file (1412 kB)
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2026