Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, Ser. 2, 2000, Volume 7, Issue 2, Pages 74–88 (Mi da303)  
This article is cited in 2 scientific papers (total 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
Full-text PDF (1412 kB) Citations (2)
Received: 26.06.2000
Bibliographic databases:
UDC: 519.853.4
Language: Russian
Citation: M. S. Nechayeva, O. V. Khamisov, “The branch-and-bound method for the problem of minimizing a nonconvex quadratic function under convex quadratic constraints”, Diskretn. Anal. Issled. Oper., Ser. 2, 7:2 (2000), 74–88
Citation in format AMSBIB
\Bibitem{NecKha00}
\by M.~S.~Nechayeva, O.~V.~Khamisov
\paper The branch-and-bound method for the problem of minimizing a~nonconvex quadratic function under convex quadratic constraints
\jour Diskretn. Anal. Issled. Oper., Ser.~2
\yr 2000
\vol 7
\issue 2
\pages 74--88
\mathnet{http://mi.mathnet.ru/da303}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1815974}
\zmath{https://zbmath.org/?q=an:0962.90035}
Linking options:
  • https://www.mathnet.ru/eng/da303
  • https://www.mathnet.ru/eng/da/v7/s2/i2/p74
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:749
    Full-text PDF :322
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024