RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., Ser. 1, 2006 Volume 13, Issue 2, Pages 3–10 (Mi da27)

This article is cited 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$.


 English version:
Journal of Applied and Industrial Mathematics, 2007, 1:3, 268–272

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024