tsp-matlab
2016-08-23
2 0 0
4.0
Other
Earn points
The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances
between each pair of cities, what is the shortest possible route that
visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
matlab
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment