1. V. V. Shenmaier, “An Exact Algorithm for Finding a Vector Subset with the Longest Sum,” Diskretn. Anal. Issled. Oper. 24 (4), 111–129 (2017) [J. Appl. Indust. Math. 11 (4), 584–593 (2017)].
2. A. V. Pyatkin, “On Complexity of a Choice Problem of the Vector Subset with the Maximum Sum Length,” Diskretn. Anal. Issled. Oper. 16 (6), 68–73 (2009) [J. Appl. Indust. Math. 4 (4), 549–552 (2010)].
3. V. V. Shenmaier, “Complexity and Approximation of Finding the Longest Vector Sum,” Zh. Vychisl. Mat. Mat. Fiz. 58 (6), 883–889 (2018) [Comput. Math. Math. Phys. 58 (6), 850–857 (2018)].
4. V. V. Shenmaier, “Complexity and Algorithms for Finding a Subset of Vectors with the Longest Sum,” in Computing and Combinatorics (Proceedings. 23rd International Conference COCOON 2017,Hong Kong, China, August 3–5, 2017) (Springer, Cham, 2017), pp. 469–480.
5. A. E. Baburin and A. V. Pyatkin, “Polynomial Algorithms for Solving the Vector Sum Problem,” Diskretn. Anal. Issled. Oper. Ser. 1, 13 (2), 3–10 (2006) [J. Appl. Indust. Math. 1 (3), 268–272 (2007)].