Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood

Rainer Ernst Burkard and Vladimir G. Deĭneko
Computing 54:191–211, 1995

Cites:

Sequence comparison with mixed convex and concave costs

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine