Facet browsing currently unavailable
Page 1 of 1 results
Sort by: relevance publication year
Showing DOI matching
10.1007/s10472-019-09626-w
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) |