On the complexity of some Euclidean optimal summing problems

DOI10.1134/S1064562416030157zbMath1348.90653OpenAlexW2461829726MaRDI QIDQ334416

Artem V. Pyatkin, Anton Valentinovich Eremeev, Alexander Kel'Manov

Publication date: 1 November 2016

Published in: Doklady Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

NP-hardness of some Euclidean problems of partitioning a finite set of points ⋮ On the complexity of some Euclidean problems of partitioning a finite set of points

Cites Work

• On the complexity of a search for a subset of ``similar vectors
• Trading Hubs Construction for Electricity Markets
• On complexity of some problems of cluster analysis of vector sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of some Euclidean optimal summing problems