1. Korbut, A.A. and Finkel’shtein, Yu.Yu., Diskretnoe programmirovanie (Discrete Programming), Moscow: Nauka, 1969.
2. Emelichev, V.A., Kovalev, M.M., and Kravtsov, M.K., Mnogogranniki, grafy, optimizatsiya (Polyhedrons, Graphs, and Optimization), Moscow: Nauka, 1981.
3. Sergienko, I.V., Matematicheskie modeli i metody resheniya zadach diskretnoi optimizatsii (Mathematical Models and Methods of Solution of Discrete Optimization Problems), Kiev: Naukova Dumka, 1988.
4. Ananth, G.Y., Kumar, V., and Pardalos, P., Parallel Processing of Discrete Optimization Problems, Encyclopedia Microcomput., 1993, vol. 13, pp. 129–147.
5. Gendron, B. and Grainic, T.G., Parallel Branch-And-Bound Survey and Synthesis, Oper. Res., 1994, vol. 42, no. 2, pp. 1042–1066.