By "autonomous" TSP heuristic I mean algorithms whose reported edge-set for a short Hamilton cycle is invariant under the addition of vertex weights; the terminology is borrowed from differential equations, interpreting vertex weights in TSP as corresponding to parameters in differential equatio...

One sort of example arises from the fact that if one starts with a Kahler form $\omega$ (which represents a class of type (1,1) in the Hodge decomposition by definition of a Kahler form), then if $\phi$ is the real part of any closed form of Hodge type (2,0), $\omega+\phi$ will still be a symplec...