1. Yu. G. Stoyan and O. O. Iemets, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], Inst. Syst. Doslidzh. Osvity, Kyiv (1993). http://dspace.puet.edu.ua/handle/123456789/487 .
2. O. O. Iemets and T. M. Barbolina, Combinatorial Optimization on Arrangements [in Ukrainian], Naukova Dumka, Kyiv (2008). http://dspace.puet.edu.ua/handle/123456789/473 .
3. G. P. Donets and L. M. Kolechkina, Extremum Problems on Combinatorial Configurations [in Ukrainian], RVV PUET, Poltava (2011). http://dspace.puet.edu.ua/handle/123456789/560 .
4. O. A. Yemets, T. N. Barbolina, and O. A. Chernenko, “Solving optimization problems with linear-fractional objective functions and additional constraints on arrangements,” Cybern. Syst. Analysis, 42, No. 5, 680–685 (2006).
5. O. O. Iemets, Ye. M. Yemets, T. A. Parfionova, and T. V. Chilikina, “Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method,” Cybern. Syst. Analysis, 49, No. 2, 264–278 (2013).