Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Lawler E. L., Bell M. D., “A method for solving discrete optimization problems”, Operat. Res., 14:6 (1966), 1098–1112 | DOI | MR
[2] Mao J. C. T., Wallingford B. A., “An extension of lawler and Bell's method of discrete optimization with examples from capital budgeting”, Management Sci., 15:2 (1968), 51–60 | DOI
[3] Diveev A. I., “Metod bimonotonnogo razlozheniya v zadache vybora optimalnogo varianta”, Vopr. teorii bezopasnosti i ustoichivosti sistem, VTs RAN, M., 1998, 94–105
[4] Diveev A. I., “Algoritm poiska optimalnoi struktury seti konveierov”, Vestn. RUDN. Ser. kibernetika, 1998, no. 1, 3–8
[5] Diveev A. I., Severtsev N. A., “Optimalnyi vybor varianta izdeliya po parametram stoimosti i nadezhnosti”, Probl. mashinostr. i nadezhnosti mashin, 2, Izd-vo RAN, M., 1999, 3–7
[6] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR
[7] Kofman A., Anri-Laborder A., Metody i modeli issledovaniya operatsii. Tselochislennoe programmirovanie, Mir, M., 1977 | MR