Results 181 to 190 of about 15,296 (207)
Some of the next articles are maybe not open access.
Heuristic Methods for Solving the Traveling Salesman Problem (TSP): A Comparative Study
2023 IEEE 34th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), 2023Chenglin Zhang, Peng Sun
openaire +1 more source
Travelling Salesman Problem (TSP): Algorithms and Approaches- A Comprehensive Survey and Analysis
The Travelling Salesman Problem (TSP) represents one of the most extensively studied NP-hard combinatorial optimization problems in computer science and operations research [10,42]. This comprehensive survey examines the evolution, current state, and future directions of TSP algorithms and approaches, analyzing over 87 recent research contributions ...openaire +1 more source
Traveling Salesman Problems with Profits
Transportation Science, 2005Dominique Feillet, Michel Gendreau
exaly
The multiple traveling salesman problem: an overview of formulations and solution procedures
Omega, 2006Tolga Bektas
exaly
On the min-cost Traveling Salesman Problem with Drone
Transportation Research Part C: Emerging Technologies, 2018Quang Minh Ha +2 more
exaly
A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
INFORMS Journal on Computing, 2019Stefan Poikonen +2 more
exaly
APLIKASI KOHONEN SELF ORGANIZING PADA TRAVELLING SALESMAN PROBLEM(TSP) DENGAN PROGRAM MATLAB
2016Travelling salesman problem is a problem that founded with sales that must go to many city and rest in a other city until back to the first city. Travelling salesman problem need an optimal ways with minimum scale, untill the process didnt need much money and others.
openaire +1 more source

