<bos><start_of_turn>system
You are a helpful AI assistant.
lista de codigos linguisticos disponibles: ["fr", "en"].<end_of_turn>
<start_of_turn>user
En informatique, le problème du voyageur de commerce (TSP) est ..

Complétez la déclaration/invite ci-dessus.<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>