Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2006_13_1_a3, author = {M. S. Ershova}, title = {The branch and bound method for a~quadratic problem of bilevel programming}, journal = {Diskretnyj analiz i issledovanie operacij}, pages = {40--56}, publisher = {mathdoc}, volume = {13}, number = {1}, year = {2006}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DA_2006_13_1_a3/} }
M. S. Ershova. The branch and bound method for a~quadratic problem of bilevel programming. Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 1, pp. 40-56. http://geodesic.mathdoc.fr/item/DA_2006_13_1_a3/
[1] Antsiferov E. G., “K metodu ellipsoidov v vypuklom programmirovanii”, Chislennye metody analiza i ikh prilozheniya, SEI SO AN SSSR, Irkutsk, 1987, 3–12
[2] Nechaeva M. S., Khamisov O. V., “Metod vetvei i granits dlya zadachi minimizatsii nevypukloi kvadratichnoi funktsii pri vypuklykh kvadratichnykh ogranicheniyakh”, Diskret. analiz i issled. operatsii. Ser. 2, 7:2 (2000), 74–88 | MR | Zbl
[3] Bard J. F., Practical bilevel optimization, Kluwer Academic Publishers, Dordrecht, 1998 | MR
[4] Bazaraa M. S., Shetti C. M., Nonlinear programming. Theory and algorithms, John Willey Sons, Inc., New York, 1993 | MR | Zbl
[5] Brooke A., Kendrick D., Meeraus A., GAMS. Release 2.25. A User's Guide, GAMS Development Corporation, 1996
[6] Dempe S., Foundations of bilevel programming, Kluwer Academic Publishers, Dordrecht, 2002 | MR | Zbl
[7] Horst R., Tuy H., Global optimization. Deterministic approaches, Springer-Verlag, Berlin, 1993 | MR
[8] Ye Y., “On the affine scaling algorithm for nonconvex quadratic programming”, Mathematical Programming, 56:2 (1992), 285–300 | MR | Zbl