Efficiently solvable special cases of hard combinatorial optimization problems

Rainer Ernst Burkard
Mathematical Programming 79:55–69, Oct 1997

Cites:

Sequence comparison with mixed convex and concave costs

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