Polynomial algorithms for solving the vector sum problem

MaRDI QIDQ3115590zbMATH OpenFDO

Authors Alexei E. Baburin, Artem Pyatkin

Publication date 10 February 2012

zbMATH Keywords

Euclidean normpolynomial-time algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 6004969
• scientific article; zbMATH DE number 6004955
• Complexity and approximation of the longest vector sum problem
• Complexity and approximation of finding the longest vector sum
• Complexity and algorithms for finding a subset of vectors with the longest sum

Cited in

(7)

• Solving some vector subset problems by Voronoi diagrams
• scientific article; zbMATH DE number 4119485 (Why is no real title available?)
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• scientific article; zbMATH DE number 892072 (Why is no real title available?)
• Approximability of the problem of finding a vector subset with the longest sum
• On the complexity and approximability of some Euclidean optimal summing problems
• An exact algorithm for finding a vector subset with the longest sum

This page was built for publication: Polynomial algorithms for solving the vector sum problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115590)