Pages that link to "Item:Q5374013"
From MaRDI portal
The following pages link to An exact algorithm for finding a vector subset with the longest sum (Q5374013):
Displaying 5 items.
- Complexity and approximation of the longest vector sum problem (Q1644921) (← links)
- Complexity and approximation of finding the longest vector sum (Q1785063) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- Approximability of the Problem of Finding a Vector Subset with the Longest Sum (Q4973237) (← links)
- Complexity and algorithms for finding a subset of vectors with the longest sum (Q5918111) (← links)