Borrar filtros
Borrar filtros

How can I solve the TSP according to Lin–Kernighan algorithm?

8 visualizaciones (últimos 30 días)
Ang Vas
Ang Vas el 18 de Abr. de 2016
Editada: Walter Roberson el 18 de Abr. de 2016
Hello everybody
I want to use a program in order to solve the Travel Salesman Problem and I found this one http://www.mathworks.com/matlabcentral/fileexchange/24857-another-tsp-solver/content/solveTSP.m which is working perfectly. What I want to ask, due to I am not very keen with Matlab is whether this program solves the TSP according to Lin–Kernighan algorithm or not

Iniciar sesión para responder a esta pregunta.

Respuestas (0)

Categorías

Más información sobre Nearest Neighbors en Help Center y File Exchange.

Etiquetas

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by