1. L. F. Gulianitsky, I. V. Sergienko, “Meta-evolutionary method of deformed polyhedron in combinatorial optimization,” Cybern. Syst. Analysis, Vol. 44, No. 6, 70–79 (2007).
2. G. A. Donets and I. V. Sergienko, “A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems,” Cybern. Syst. Analysis, Vol. 50, No. 1, 3–11 (2014).
3. N. Z. Shor and P. I. Stetsyuk, “Lagrangian bounds in multiextremal polynomial and discrete optimization problems,” J. of Global Optimization, No. 23, 1–41 (2002).
4. G. P. Donets and L. M. Kolechkina, Extremum Problems on Combinatorial Configurations [in Ukrainian], PUET, Poltava (2011).
5. N. V. Semenova and L. M. Kolechkina, Vector Problems of Combinatorial Optimization on Combinatorial Configurations: Methods of Analysis and Solution [in Ukrainian], Naukova Dumka, Kyiv (2009).