@inproceedings{c9445d010c60487ab5bbf2de38ed2d0d,

title = "On vector summation problem in the euclidean space",

abstract = "We consider a problem of finding a subset of the smallest size in the given set of vectors such that the norm of sum vector is greater or equal to some given value. We show that the problem can be solved optimally with the same complexity as the problem of finding the subset of given cardinality with minimum norm of sum vector.",

keywords = "Euclidean space, Exact algorithm, Sum vector, Vector subset",

author = "Gimadi, {Edward Kh} and Rykov, {Ivan A.} and Shamardin, {Yury V.}",

year = "2018",

month = jan,

day = "1",

doi = "10.1007/978-3-319-93800-4_11",

language = "English",

isbn = "9783319937991",

series = "Communications in Computer and Information Science",

publisher = "Springer-Verlag GmbH and Co. KG",

pages = "131--136",

booktitle = "Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers",

address = "Germany",

note = "7th International Conference on Optimization Problems and Their Applications, OPTA 2018 ; Conference date: 08-06-2018 Through 14-06-2018",

}