1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness (Freeman, San Francisco, 1979; Mir, Moscow, 1982).
2. I. A. Davydov, Yu. A. Kochetov, N. Mladenovi, and D. Urosevi, “FastMetaheuristics for the Discrete (rp)- Centroid Problem,” Avtomat. i Telemekh. No. 4, 106–119 (2014) [Automat. Remote Control 75 (4), 677–687 (2014)].
3. V. T. Dement’ev and Yu. V. Shamardin, “The Problem of Price Selection for Production under the Condition of Obligatory Satisfaction of Demand,” Diskret. Anal. Issled. Oper. Ser. 2, 9 (2), 31–40 (2002).
4. Yu. A. Kochetov and A. V. Plyasunov, “A Polynomially Solvable Class of Two-Level Linear Programming Problems,” Diskret. Anal. Issled. Oper. Ser. 2, 1 (2), 23–33 (1997).
5. Yu. A. Kochetov and A. V. Plyasunov, “Genetic Local Search the Graph Partitioning Problem under Cardinality Constraints,” Zh. Vychisl. Mat. Mat. Fiz. 52 (1), 164–176 (2012.) [Comput. Math. Math. Phys.52 (1), 157–167 (2012)].