The case of the traveling salesman.

• Autores: William J. Cook
• Localización: Scientific American, ISSN 0036-8733, Vol. 306, Nº. 6, 2012, págs. 26-26
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • The article discusses how a seemingly unsolvable mathematical problem, called the traveling salesman problem (TSP), offers insight into the limits of computation. An overview of the TSP problem and a computational tool, called linear programming, that assigns fractions to roads that join in pairs of cities rather than deciding whether to use the road or not when attempting to find the shortest route to individual cities is presented.