Results 101 to 110 of about 5,666,790 (163)

Probabilistic greedy algorithm solver using magnetic tunneling junctions for traveling salesman problem. [PDF]

open access: yesNat Commun
Zhang R   +17 more
europepmc   +1 more source

Implementing Tabu Search to Exploit Sparsity in ATSP Instances [PDF]

open access: yes
Real life traveling salesman problem (TSP) instances are often large,sparse, and asymmetric. Conventional tabu search implementations for the TSP that have been reported in the literature, almost always deals with small, dense and symmetric instances. In
Sumanta Basu   +2 more
core  

Home - About - Disclaimer - Privacy