<bos><start_of_turn>system
You are a helpful AI assistant.
lista de codigos linguisticos disponibles: ["es", "en"].<end_of_turn>
<start_of_turn>user
Complete el enunciado: En informática, el problema del viajante (TSP) es...<end_of_turn>
<start_of_turn>model
an optimization problem that seeks to determine the shortest possible route that visits each city (or node) exactly once and returns to the original city. It is NP-hard, meaning that no polynomial-time algorithm is known to solve the problem exactly for all possible sets of cities, and it is believed that no such algorithm exists.<end_of_turn><eos>