Talk:Travelling salesman problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Help Wikipedia by adding to this page?[change source]

It might be more helpful to remove the page completely. Albert Einstein has often been misquoted as "Keep it as simple as possible." The complete sentence is "Keep it as simple as possible but no simpler."

The "Travelling Salesman Problem" is not concerned with travelling salesmen. I might have some relevance to the layout of printed circuit boards but is otherwise a mathematical curiosity.

Colin M Davidson. 21:46, 12 March 2007 (UTC)

I agree.

Or, maybe, actually making it accurate would be better — Preceding unsigned comment added by (talkcontribs)

By its very nature, the TSP (and related problems, eg. Chinese postman) is a mathematical/Computer science problem. Unlike the Chinese postman, it has a wide variety of uses, and is generally well-known outside the field of math/comp.sci. Another note: those of you who contributed as IPs, and who weant to contribute regularly: please create an account. It does not involve collecting personal info, and gives you the right to vote in various discussions. --Eptalon (talk) 09:53, 24 February 2009 (UTC)

Yes, it is a mathematical problem. The page here, however, does not even closely depict it as such. — Preceding unsigned comment added by (talkcontribs)