Geodesic
A two-level choice problem for a system of machines and nodes with a nonlinear production function
Sibirskij žurnal industrialʹnoj matematiki, Tome 9 (2006) no. 2, pp. 44-54 
E. Kh. Gimadi; E. N. Goncharov. A two-level choice problem for a system of machines and nodes with a nonlinear production function. Sibirskij žurnal industrialʹnoj matematiki, Tome 9 (2006) no. 2, pp. 44-54. http://geodesic.mathdoc.fr/item/SJIM_2006_9_2_a4/
@article{SJIM_2006_9_2_a4,
     author = {E. Kh. Gimadi and E. N. Goncharov},
     title = {A~two-level choice problem for a~system of machines and nodes with a~nonlinear production function},
     journal = {Sibirskij \v{z}urnal industrialʹnoj matematiki},
     pages = {44--54},
     year = {2006},
     volume = {9},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJIM_2006_9_2_a4/}
}
TY  - JOUR
AU  - E. Kh. Gimadi
AU  - E. N. Goncharov
TI  - A two-level choice problem for a system of machines and nodes with a nonlinear production function
JO  - Sibirskij žurnal industrialʹnoj matematiki
PY  - 2006
SP  - 44
EP  - 54
VL  - 9
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/SJIM_2006_9_2_a4/
LA  - ru
ID  - SJIM_2006_9_2_a4
ER  - 
%0 Journal Article
%A E. Kh. Gimadi
%A E. N. Goncharov
%T A two-level choice problem for a system of machines and nodes with a nonlinear production function
%J Sibirskij žurnal industrialʹnoj matematiki
%D 2006
%P 44-54
%V 9
%N 2
%U http://geodesic.mathdoc.fr/item/SJIM_2006_9_2_a4/
%G ru
%F SJIM_2006_9_2_a4

Voir la notice de l'article provenant de la source Math-Net.Ru

[1] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR

[2] Beresnev V. L., Gimadi E. Kh., Dementev V. T., Ekstremalnye zadachi standartizatsii, Nauka, Novosibirsk, 1978 | MR

[3] Goncharov E. N., “Metod vetvei i granits dlya prosteishei dvukhurovnevoi zadachi razmescheniya predpriyatii”, Diskret. analiz i issledovanie operatsii. Ser. 2, 5:1 (1998), 19–39 | MR | Zbl

[4] Goncharov E. N., Kochetov Yu. A., “Povedenie veroyatnostnykh zhadnykh algoritmov dlya mnogostadiinoi zadachi razmescheniya”, Diskret. analiz i issledovanie operatsii. Ser. 2, 6:1 (1999), 12–32 | MR | Zbl

[5] Tcha D. W., Lee B.-I., “A branch-and-bound algorithm for the multilevel uncapacitated facility location problem”, European J. Oper. Res., 18:1 (1984), 35–43 | DOI | MR | Zbl

[6] Cornuejols G., Nemhauser G. L., Wolsey L. A., “The uncapacitated facility location problem”, Discrete Location Theory, Wiley Sons, New York, 1990, 119–171 | MR

[7] Beresnev V. L., Goncharov E. N., “Priblizhennyi algoritm dlya zadachi minimizatsii polinomov ot bulevykh peremennykh”, Diskret. analiz i issledovanie operatsii. Ser. 2, 5:2 (1998), 3–19 | MR | Zbl

[8] Gorbachevskaya L. E., Dementev V. T., Shamardin Yu. V., “Dvukhurovnevaya zadacha standartizatsii s usloviem edinstvennosti optimalnogo potrebitelskogo vybora”, Diskret. analiz i issledovanie operatsii. Ser. 2, 6:2 (1999), 3–11 | MR | Zbl

[9] Krarup J., Pruzan P., “The simple plant location problem: survey and synthesis”, European J. Oper. Res., 12:1 (1983), 36–81 | DOI | MR | Zbl

[10] Algin V. B., Dolgui A., Gimadi E. Kh., Goncharov E. N., “Optimal design of machines dedicated to a given set of jobs”, Proc. Internat. Conf. DOM'2004, Omsk, 2004, 33–38