Abstract: The Traveling Salesman Problem (TSP) is a challenging combinatorial optimization problem classified as NP-hard. This paper investigates the performance of various meta-heuristic algorithms, ...
For a project in Bangladesh, Prof. Mushfiq Mobarak and his team used machine-learning models applied to mobile phone records ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback