Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2002_9_2_a4, author = {Yu. A. Kochetov and A. V. Plyasunov}, title = {The problem of the choice of a series of goods with partial external financing}, journal = {Diskretnyj analiz i issledovanie operacij}, pages = {78--96}, publisher = {mathdoc}, volume = {9}, number = {2}, year = {2002}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DA_2002_9_2_a4/} }
TY - JOUR AU - Yu. A. Kochetov AU - A. V. Plyasunov TI - The problem of the choice of a series of goods with partial external financing JO - Diskretnyj analiz i issledovanie operacij PY - 2002 SP - 78 EP - 96 VL - 9 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DA_2002_9_2_a4/ LA - ru ID - DA_2002_9_2_a4 ER -
Yu. A. Kochetov; A. V. Plyasunov. The problem of the choice of a series of goods with partial external financing. Diskretnyj analiz i issledovanie operacij, Tome 9 (2002) no. 2, pp. 78-96. http://geodesic.mathdoc.fr/item/DA_2002_9_2_a4/
[1] Beresnev V. L., “Algoritmy minimizatsii polinomov ot bulevykh peremennykh”, Problemy kibernetiki, 1979, no. 36, 225–246, Nauka, M. | MR
[2] Beresnev V. L., Gimadi E. X., Dementev V. T., Ekstremalnye zadachi standartizatsii, Nauka, Novosibirsk, 1978 | MR
[3] Gimadi E. X., “Effektivnyi algoritm resheniya zadachi razmescheniya s oblastyami obsluzhivaniya, svyaznymi otnositelno atsiklicheskoi seti”, Upravlyaemye sistemy, Sb. nauch. tr., no. 23, In-t matematiki SO AN SSSR, Novosibirsk, 1983, 12–23 | MR
[4] Gimadi E. X., “Zadacha standartizatsii s dannymi proizvolnogo znaka i svyaznymi, kvazivypuklymi i pochti kvazivypuklymi matritsami”, Upravlyaemye sistemy, Sb. nauch. tr., no. 27, In-t matematiki SO AN SSSR, Novosibirsk, 1987, 3–11 | MR
[5] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR
[6] Kochetov Yu. A., “Veroyatnostnye metody lokalnogo poiska dlya zadach diskretnoi optimizatsii”, Diskretnaya matematika i ee prilozheniya, Sb. lektsii, no. 1, Izd-vo tsentra prikl. issled. pri mekh.-mat. fak. MGU, M., 2001, 84–117
[7] Kochetov Yu. A., Plyasunov A. V., “Polinomialno razreshimyi klass zadach dvukhurovnevogo lineinogo programmirovaniya”, Diskret. analiz i issled. operatsii. Ser. 2, 4:2 (1997), 23–33 | MR
[8] Plyasunov A. V., “Ob odnom podkhode k resheniyu zadach dvukhurovnevogo programmirovaniya”, Metody optimizatsii i ikh prilozheniya, Tr. XII Baikalskoi mezhdunar. konf., Izd-vo Irkut. un-ta, Irkutsk, 2001, 227–231
[9] Cornuejols G., Fisher M. L., Nemhauser G. L., “Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms”, Management Sci., 23:8 (1977), 789–810 | DOI | MR | Zbl
[10] Cornuejols G., Fisher M. L., Nemhauser G. L., “On the uncapacitated location problem”, Studies in integer programming, Annals of Discrete Math., 1, North-Holland, Amsterdam, 1977, 163–177 | MR
[11] Hochbaum D. S., “Heuristics for the fixed cost median problem”, Math. Programming, 22:1 (1982), 148–162 | DOI | MR | Zbl
[12] Ishizuka Y., Aiyoshi E., “Doubly penalty method for bilevel programming problem”, Ann. Oper. Res., 34:1–4 (1992), 73–88 | DOI | MR | Zbl
[13] Krarup J., Pruzan P. M., “The simple plant location problem: survey and synthesis”, European J. Oper. Res., 12:1 (1983), 36–81 | DOI | MR | Zbl
[14] Savard G., Gauvin J., “The steepest descent direction for the nonlinear bilevel programming problem”, Oper. Res. Lett., 15:5 (1994), 265–272 | DOI | MR | Zbl