On complexity of a choice problem of the vector subset with the maximum sum length

A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, and A. V. Pyatkin, “The Problem of Finding a Subset of Vectors with the Maximum Total Weight,” Diskret. Anal. Issled. Oper. Ser. 2, 14(1), 32–42 (2007) [J. Appl. Indust. Math. 2 (1), 32–38 (2008)]. A. E. Baburin and A.V. Pyatkin, “Polynomial Algorithms for Solving the Vector Sum Problem,” Diskret. Anal. Issled. Oper. Ser. 1, 13(2), 3–10 (2006) [J. Appl. Indust. Math. 1 (3), 268–272 (2007)]. E. Kh. Gimadi, A. V. Pyatkin, and I. A. Rykov, “On Polynomial Solvability of Some Problems of a Vector Subset Choice in a Euclidean Space of Fixed Dimension,” Diskret. Anal. Issled. Oper. 15(6), 11–19 (2008) [J. Appl. Indust. Math. 4 (1), 48–53 (2010)]. M. Garey and D. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness (W. H. Freeman and Company, New York, 1979; Mir, Moscow, 1982). M. I. Kadetz, “On one Property of the Vector Broken Lines in n-Dimensional Space,” Uspekhi Mat. Nauk 8(1), 139–143 (1953). A. V. Kelmanov and A. V. Pyatkin, “On a Version of the Problem of Choosing a Vector Subset,” Diskret. Anal. Issled. Oper. 15(5), 20–34 (2008) [J. Appl. Indust. Math. 3 (4), 447–455 (2009)].