Re: P=NP: Linear Programming Formulation of the TSP

Mr. Jarfo - The number of 0/1 variables in classical TSP formulations
is usually on the order of n^2 (at least), where n is the number of
cities. Brute force enumeration for an 8-city problem would therefore
require on the order of 2^64 evaluations (some number on the order of
10^14).
I don't see the connection between your table above and the variables
and constraints in my paper. I think the discussion in the paper is
precise enough that you can make your points by addressing the model
and proofs in the paper directly.
I don't mean to be rude, but to be frank, this is definitely not the
kind of discussion I thought I would be inviting when I posted on the
usenet, and I am unwilling to continue it. I am going to re-iterate my
first suggestion to you: PLEASE, TAKE THE TIME TO READ THE PAPER AND
UNDERSTAND IT.

.