Another shot at the travelling salesman problem

H. Kleiman has written a (very short) paper in which he claims to have proven that P=NP. Many of the usual red flags are up; e.g., his article is only available as a pdf (i.e., he provides no LaTeX source) and the references are light. On the other hand, he withholds the usual bluster with which such claims are made, instead using language like "we (hopefully) can always obtain an optimal tour in M(a) in polynomial time" and "[i]f the algorithm has no errors, ... P=NP." Time will tell...