Reply to thread

Message: [QUOTE="Patricia Shanahan, post: 3614630"] Good, because, although I like to keep an open mind, "it's all incorrect" is the way to bet on proposed polynomial time algorithms for NP-complete problems. Many, many times, on a wide range of project sizes, including complete computer system developments, hardware as well as software. However, the issue here is simply coding an algorithm you know in a language you know. That is tiny compared to any sort of product development, even a small software application. It's more like a fraction of one weeks' homework for a CS student taking an algorithms course. If you produce a working implementation of a polynomial time algorithm for 2-D Euclidean TSP you will have no trouble at all getting all the help you need on the rest of your project. Patricia [/QUOTE]