Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 1 results
Sort by: relevance publication year

Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters

JOURNAL ARTICLE published March 2020 in Annals of Mathematics and Artificial Intelligence

Research funded by Russian Science Foundation (14-11-00109)

Authors: Michael Khachay | Katherine Neznakhina