Abstract: The bottleneck traveling salesman problem (BTSP) is a variation of the well-known traveling salesman problem (TSP) in which the goal is to identify a Hamiltonian circuit with the lowest ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results