Abstract: The traveling salesman problem (TSP) is widely known as one of the most important NP-hard combinatorial optimization problems. In this paper, we consider the min-max regret traveling ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results