|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2006, Volume 13, Issue 2, Pages 3–10
(Mi da27)
|
|
|
|
This article is cited in 18 scientific papers (total in 18 papers)
Polynomial algorithms for solving the vector sum problem
A. E. Baburin, A. V. Pyatkin Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
The problem is investigated of weighted sum maximization of a given finite set of vectors from the finite-dimensional vector space $\mathbb R^k$. Polynomial algorithms solving it are presented and analyzed in the case when a finite polyhedral norm or the $l_2$ norm is defined on $\mathbb R^k$.
Citation:
A. E. Baburin, A. V. Pyatkin, “Polynomial algorithms for solving the vector sum problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:2 (2006), 3–10; J. Appl. Industr. Math., 1:3 (2007), 268–272
Linking options:
https://www.mathnet.ru/eng/da27 https://www.mathnet.ru/eng/da/v13/s1/i2/p3
|
Statistics & downloads: |
Abstract page: | 524 | Full-text PDF : | 173 | References: | 62 |
|