On polynomial solvability of some problems of a vector subset choice in a Euclidean space of fixed dimension
Tóm tắt
Từ khóa
Tài liệu tham khảo
A. E. Baburin, A. V. Pyatkin, “Polynomial Algorithms for Solving the Vector Sum Problem,” Diskret. Analiz i Issled. Oper. Ser. 1, 13(2), 3–10 (2006) [J. Appl. Indust.Math. 1 (3), 268–272 (2007)].
E. Kh. Gimadi, Yu. V. Glazkov, and I. A. Rykov, “On Two Problems of Choosing Some Subset of Vectors with Integer Coordinates That Has the Maximum Norm of the Sum of Elements in Euclidean Space,” Diskret. Analiz i Issled. Oper. 15(4), 30–43 (2008) [J. Appl. Indust. Math. 3 (3), 343–352 (2009)].
E. Kh. Gimadi, A. V. Kelmanov, M. A. Kelmanova, and S. A. Khamidullin, “A posteriori Search in a Number Sequence for a Quasiperiodically Repeating Fragment with a Given Number of Repeats,” Sibirsk. Zh. Indust. Mat. 9(1), 55–74 (2006).
A. V. Kelmanov and A. V. Pyatkin, “On a Version of the Problem of Choosing a Vector Subset,” Diskret. Analiz i Issled. Oper. 15(5), 20–34 (2008) [J. Appl. Indust. Math. 3 (4), 447–455 (2009)].
A.V. Kelmanov, S. A. Khamidullin, and L.V. Okolnishnikova, “A posteriori Search for the Same Subsequence- Fragments in a Quasiperiodical Sequence,” Sibirsk. Zh. Indust. Mat. 5(2), 94–108 (2002).
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. Analiz i Issled. Oper. Ser. 2, 14(1), 32–42 (2007) [J. Appl. Indust. Math. 2 (1), 32–38 (2008)].