An exact algorithm for finding a vector subset with the longest sum

DOI10.1134/S1990478917040160zbMath1399.90223OpenAlexW2769581184MaRDI QIDQ5374013

V. V. Shenmaier

Publication date: 6 April 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478917040160

zbMATH Keywords

Euclidean spacepolynomial-time algorithmoptimal solutionsum vectorsearch for a vector subset

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (4)

Complexity and approximation of finding the longest vector sum ⋮ Complexity and algorithms for finding a subset of vectors with the longest sum ⋮ Easy NP-hardness Proofs of Some Subset Choice Problems ⋮ Approximability of the Problem of Finding a Vector Subset with the Longest Sum

Cites Work

• The densest hemisphere problem
• The Vector Partition Problem for Convex Objective Functions
• Solving some vector subset problems by Voronoi diagrams
• Constructing Arrangements of Lines and Hyperplanes with Applications
• A Polynomial Time Algorithm for Shaped Partition Problems
• Partition of Space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An exact algorithm for finding a vector subset with the longest sum