58 citations · 97 across the 7 of their papers we have counts for
1 paper · 2 filters
Camelia-M. Pintea, Petrica C. Pop, Camelia Chira
A well known N P-hard problem called the Generalized Traveling Salesman Problem (GTSP) is considered. In GTSP the nodes of a complete undirected graph are partitioned into clusters…