Pregunta:
Nearest Insertion..
Autor: jakob bRespuesta:
1. Start in any node, creating a subtour T 2. Find the node k closest to any node in T 3. Put k in the best place in the tour T 4. Continue until all nodes are included
0 / 5 (0 calificaciones)
1 answer(s) in total
Autor
jakob b