An exact algorithm for finding a vector subset with the longest sum (Q5374013)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6857067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for finding a vector subset with the longest sum |
scientific article; zbMATH DE number 6857067 |
Statements
An exact algorithm for finding a vector subset with the longest sum (English)
0 references
6 April 2018
0 references
sum vector
0 references
search for a vector subset
0 references
Euclidean space
0 references
polynomial-time algorithm
0 references
optimal solution
0 references
0 references
0.9070417881011964
0 references
0.9059457182884216
0 references
0.8563683032989502
0 references
