Abstract: The min-max multiple traveling salesman problem (minmax mTSP) is one of the most well-known combinatorial optimization problems (COPs). As a non-deterministic polynomial problem, the min-max ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback