5 citations · 5 across the 1 of their papers we have counts for
1 paper
Yuhong Cao, Zhanhong Sun, Guillaume Sartoretti
The multiple traveling salesman problem (mTSP) is a well-known NP-hard problem with numerous real-world applications. In particular, this work addresses MinMax mTSP, where the obje…