Heuristics for tsp without triangle inequality Every heuristic for the traveling salesman problem that I know of (Nearest-Neighbour, Christofides, Held-Karp, ...) assumes that the triangle inequality holds. 

Are there heuristics to solve the tsp that don't assume the triangle inequality and still perform well*?
If there aren't, why is that?

*i.e. don't run for a year for 100 cities and get relatively close to the optimum
I hope this partly answers your question: Most known heuristics like Greedy, Naerest Neighbor, Lin-Kerninhan etc. 
perfrom quite well for (symmetric) TSP without triangle inequality.

You may check these heuristics with the Concorde TSP Solver 
which is the best TSP solver I know so far.

In theory, there is no heuristic for TSP without triangle inequality that performs well 
(like Christofides for metric TSP). 
This is due to the well known fact that TSP cannot be approximated within any 
polynomial time computable function unless P=NP.