共 50 条
- [41] AN ALGORITHM FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WHICH IS OPTIMAL WITH PROBABILITY ONE ANAIS DA ACADEMIA BRASILEIRA DE CIENCIAS, 1981, 53 (03): : 625 - 625
- [45] Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters Annals of Mathematics and Artificial Intelligence, 2020, 88 : 53 - 69